java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:15:31,938 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:15:31,941 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:15:31,958 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:15:31,959 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:15:31,960 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:15:31,962 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:15:31,965 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:15:31,967 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:15:31,968 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:15:31,969 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:15:31,970 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:15:31,971 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:15:31,972 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:15:31,973 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:15:31,974 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:15:31,975 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:15:31,977 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:15:31,979 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:15:31,983 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:15:31,984 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:15:31,985 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:15:31,989 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:15:31,990 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:15:31,990 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:15:31,991 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:15:31,992 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:15:31,993 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:15:31,995 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:15:31,996 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:15:31,996 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:15:31,998 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:15:31,999 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:15:31,999 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:15:32,002 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:15:32,003 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:15:32,004 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 13:15:32,021 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:15:32,022 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:15:32,023 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:15:32,023 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:15:32,023 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:15:32,024 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:15:32,024 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:15:32,024 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:15:32,084 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:15:32,103 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:15:32,109 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:15:32,111 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:15:32,111 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:15:32,112 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl [2018-07-25 13:15:32,112 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl' [2018-07-25 13:15:32,188 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:15:32,190 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:15:32,191 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:15:32,191 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:15:32,191 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:15:32,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:32" (1/1) ... [2018-07-25 13:15:32,227 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:32" (1/1) ... [2018-07-25 13:15:32,232 WARN L165 Inliner]: Program contained no entry procedure! [2018-07-25 13:15:32,232 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-07-25 13:15:32,233 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-07-25 13:15:32,235 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:15:32,236 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:15:32,236 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:15:32,237 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:15:32,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:32" (1/1) ... [2018-07-25 13:15:32,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:32" (1/1) ... [2018-07-25 13:15:32,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:32" (1/1) ... [2018-07-25 13:15:32,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:32" (1/1) ... [2018-07-25 13:15:32,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:32" (1/1) ... [2018-07-25 13:15:32,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:32" (1/1) ... [2018-07-25 13:15:32,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:32" (1/1) ... [2018-07-25 13:15:32,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:15:32,275 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:15:32,275 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:15:32,275 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:15:32,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:32" (1/1) ... [2018-07-25 13:15:32,368 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-07-25 13:15:32,369 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-07-25 13:15:32,369 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-07-25 13:15:32,628 INFO L270 CfgBuilder]: Using library mode [2018-07-25 13:15:32,629 INFO L202 PluginConnector]: Adding new model threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:15:32 BoogieIcfgContainer [2018-07-25 13:15:32,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:15:32,631 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:15:32,631 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:15:32,634 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:15:32,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:32" (1/2) ... [2018-07-25 13:15:32,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c10c13 and model type threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:15:32, skipping insertion in model container [2018-07-25 13:15:32,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:15:32" (2/2) ... [2018-07-25 13:15:32,639 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out2.mover.bpl [2018-07-25 13:15:32,650 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:15:32,661 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-07-25 13:15:32,715 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:15:32,716 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:15:32,716 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:15:32,717 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:15:32,717 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:15:32,717 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:15:32,717 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:15:32,718 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:15:32,718 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:15:32,738 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-07-25 13:15:32,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 13:15:32,750 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:32,751 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 13:15:32,753 INFO L415 AbstractCegarLoop]: === Iteration 1 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:32,759 INFO L82 PathProgramCache]: Analyzing trace with hash 934210, now seen corresponding path program 1 times [2018-07-25 13:15:32,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:32,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:32,857 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:32,858 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:15:32,863 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:15:32,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:15:32,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:15:32,884 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 5 states. [2018-07-25 13:15:33,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:33,153 INFO L93 Difference]: Finished difference Result 30 states and 67 transitions. [2018-07-25 13:15:33,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:15:33,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-07-25 13:15:33,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:33,175 INFO L225 Difference]: With dead ends: 30 [2018-07-25 13:15:33,175 INFO L226 Difference]: Without dead ends: 28 [2018-07-25 13:15:33,182 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:33,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-07-25 13:15:33,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2018-07-25 13:15:33,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-07-25 13:15:33,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 48 transitions. [2018-07-25 13:15:33,233 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 48 transitions. Word has length 4 [2018-07-25 13:15:33,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:33,234 INFO L472 AbstractCegarLoop]: Abstraction has 22 states and 48 transitions. [2018-07-25 13:15:33,234 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:15:33,234 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 48 transitions. [2018-07-25 13:15:33,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 13:15:33,236 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:33,236 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 13:15:33,237 INFO L415 AbstractCegarLoop]: === Iteration 2 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:33,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1042904, now seen corresponding path program 1 times [2018-07-25 13:15:33,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:33,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:33,304 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:33,304 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:15:33,309 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:15:33,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:15:33,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:15:33,313 INFO L87 Difference]: Start difference. First operand 22 states and 48 transitions. Second operand 5 states. [2018-07-25 13:15:33,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:33,572 INFO L93 Difference]: Finished difference Result 50 states and 117 transitions. [2018-07-25 13:15:33,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:15:33,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-07-25 13:15:33,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:33,578 INFO L225 Difference]: With dead ends: 50 [2018-07-25 13:15:33,578 INFO L226 Difference]: Without dead ends: 46 [2018-07-25 13:15:33,579 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:15:33,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-07-25 13:15:33,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2018-07-25 13:15:33,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-07-25 13:15:33,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 101 transitions. [2018-07-25 13:15:33,601 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 101 transitions. Word has length 4 [2018-07-25 13:15:33,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:33,601 INFO L472 AbstractCegarLoop]: Abstraction has 40 states and 101 transitions. [2018-07-25 13:15:33,601 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:15:33,601 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 101 transitions. [2018-07-25 13:15:33,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:15:33,602 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:33,602 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:15:33,603 INFO L415 AbstractCegarLoop]: === Iteration 3 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:33,603 INFO L82 PathProgramCache]: Analyzing trace with hash 897576008, now seen corresponding path program 1 times [2018-07-25 13:15:33,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:33,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:33,634 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:33,634 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:15:33,634 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:15:33,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:15:33,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:15:33,638 INFO L87 Difference]: Start difference. First operand 40 states and 101 transitions. Second operand 6 states. [2018-07-25 13:15:33,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:33,967 INFO L93 Difference]: Finished difference Result 152 states and 379 transitions. [2018-07-25 13:15:33,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:15:33,968 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-25 13:15:33,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:33,977 INFO L225 Difference]: With dead ends: 152 [2018-07-25 13:15:33,977 INFO L226 Difference]: Without dead ends: 148 [2018-07-25 13:15:33,978 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:15:33,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-07-25 13:15:34,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 76. [2018-07-25 13:15:34,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-07-25 13:15:34,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 225 transitions. [2018-07-25 13:15:34,028 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 225 transitions. Word has length 6 [2018-07-25 13:15:34,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:34,030 INFO L472 AbstractCegarLoop]: Abstraction has 76 states and 225 transitions. [2018-07-25 13:15:34,030 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:15:34,030 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 225 transitions. [2018-07-25 13:15:34,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:15:34,032 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:34,033 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:15:34,033 INFO L415 AbstractCegarLoop]: === Iteration 4 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:34,034 INFO L82 PathProgramCache]: Analyzing trace with hash 897578922, now seen corresponding path program 1 times [2018-07-25 13:15:34,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:34,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:34,052 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:34,052 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:15:34,052 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:15:34,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:15:34,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:15:34,054 INFO L87 Difference]: Start difference. First operand 76 states and 225 transitions. Second operand 6 states. [2018-07-25 13:15:34,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:34,256 INFO L93 Difference]: Finished difference Result 148 states and 381 transitions. [2018-07-25 13:15:34,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:15:34,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-25 13:15:34,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:34,259 INFO L225 Difference]: With dead ends: 148 [2018-07-25 13:15:34,259 INFO L226 Difference]: Without dead ends: 144 [2018-07-25 13:15:34,262 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:15:34,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-07-25 13:15:34,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 87. [2018-07-25 13:15:34,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-25 13:15:34,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 262 transitions. [2018-07-25 13:15:34,301 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 262 transitions. Word has length 6 [2018-07-25 13:15:34,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:34,301 INFO L472 AbstractCegarLoop]: Abstraction has 87 states and 262 transitions. [2018-07-25 13:15:34,302 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:15:34,302 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 262 transitions. [2018-07-25 13:15:34,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:15:34,303 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:34,303 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:15:34,305 INFO L415 AbstractCegarLoop]: === Iteration 5 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:34,306 INFO L82 PathProgramCache]: Analyzing trace with hash 897783584, now seen corresponding path program 1 times [2018-07-25 13:15:34,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:34,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:34,323 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:34,324 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:15:34,324 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:15:34,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:15:34,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:15:34,326 INFO L87 Difference]: Start difference. First operand 87 states and 262 transitions. Second operand 6 states. [2018-07-25 13:15:34,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:34,532 INFO L93 Difference]: Finished difference Result 171 states and 457 transitions. [2018-07-25 13:15:34,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:15:34,533 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-25 13:15:34,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:34,536 INFO L225 Difference]: With dead ends: 171 [2018-07-25 13:15:34,536 INFO L226 Difference]: Without dead ends: 167 [2018-07-25 13:15:34,539 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:15:34,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-25 13:15:34,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 96. [2018-07-25 13:15:34,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-07-25 13:15:34,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 287 transitions. [2018-07-25 13:15:34,587 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 287 transitions. Word has length 6 [2018-07-25 13:15:34,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:34,587 INFO L472 AbstractCegarLoop]: Abstraction has 96 states and 287 transitions. [2018-07-25 13:15:34,588 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:15:34,588 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 287 transitions. [2018-07-25 13:15:34,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:15:34,591 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:34,591 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-25 13:15:34,592 INFO L415 AbstractCegarLoop]: === Iteration 6 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:34,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1002235768, now seen corresponding path program 1 times [2018-07-25 13:15:34,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:34,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:34,613 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:34,613 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 13:15:34,613 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:15:34,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:15:34,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:15:34,615 INFO L87 Difference]: Start difference. First operand 96 states and 287 transitions. Second operand 6 states. [2018-07-25 13:15:34,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:34,766 INFO L93 Difference]: Finished difference Result 117 states and 345 transitions. [2018-07-25 13:15:34,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:15:34,767 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-25 13:15:34,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:34,770 INFO L225 Difference]: With dead ends: 117 [2018-07-25 13:15:34,770 INFO L226 Difference]: Without dead ends: 115 [2018-07-25 13:15:34,771 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:15:34,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-25 13:15:34,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 89. [2018-07-25 13:15:34,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-25 13:15:34,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 261 transitions. [2018-07-25 13:15:34,817 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 261 transitions. Word has length 6 [2018-07-25 13:15:34,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:34,817 INFO L472 AbstractCegarLoop]: Abstraction has 89 states and 261 transitions. [2018-07-25 13:15:34,817 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:15:34,818 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 261 transitions. [2018-07-25 13:15:34,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:15:34,819 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:34,819 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:15:34,820 INFO L415 AbstractCegarLoop]: === Iteration 7 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:34,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1002208758, now seen corresponding path program 1 times [2018-07-25 13:15:34,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:34,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:34,840 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:34,840 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:15:34,841 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:15:34,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:15:34,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:15:34,842 INFO L87 Difference]: Start difference. First operand 89 states and 261 transitions. Second operand 6 states. [2018-07-25 13:15:35,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:35,078 INFO L93 Difference]: Finished difference Result 203 states and 555 transitions. [2018-07-25 13:15:35,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:15:35,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-25 13:15:35,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:35,083 INFO L225 Difference]: With dead ends: 203 [2018-07-25 13:15:35,083 INFO L226 Difference]: Without dead ends: 199 [2018-07-25 13:15:35,084 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:15:35,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-07-25 13:15:35,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 138. [2018-07-25 13:15:35,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-07-25 13:15:35,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 418 transitions. [2018-07-25 13:15:35,149 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 418 transitions. Word has length 6 [2018-07-25 13:15:35,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:35,150 INFO L472 AbstractCegarLoop]: Abstraction has 138 states and 418 transitions. [2018-07-25 13:15:35,150 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:15:35,150 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 418 transitions. [2018-07-25 13:15:35,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:15:35,151 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:35,151 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:15:35,152 INFO L415 AbstractCegarLoop]: === Iteration 8 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:35,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1000027257, now seen corresponding path program 1 times [2018-07-25 13:15:35,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:35,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:35,185 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:35,186 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:15:35,186 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:15:35,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:15:35,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:15:35,187 INFO L87 Difference]: Start difference. First operand 138 states and 418 transitions. Second operand 6 states. [2018-07-25 13:15:35,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:35,449 INFO L93 Difference]: Finished difference Result 233 states and 646 transitions. [2018-07-25 13:15:35,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:15:35,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-25 13:15:35,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:35,452 INFO L225 Difference]: With dead ends: 233 [2018-07-25 13:15:35,452 INFO L226 Difference]: Without dead ends: 229 [2018-07-25 13:15:35,453 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:15:35,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-07-25 13:15:35,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 150. [2018-07-25 13:15:35,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-07-25 13:15:35,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 463 transitions. [2018-07-25 13:15:35,515 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 463 transitions. Word has length 6 [2018-07-25 13:15:35,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:35,515 INFO L472 AbstractCegarLoop]: Abstraction has 150 states and 463 transitions. [2018-07-25 13:15:35,515 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:15:35,516 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 463 transitions. [2018-07-25 13:15:35,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:15:35,517 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:35,517 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:15:35,520 INFO L415 AbstractCegarLoop]: === Iteration 9 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:35,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1000030171, now seen corresponding path program 1 times [2018-07-25 13:15:35,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:35,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:35,545 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:35,545 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:15:35,546 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:15:35,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:15:35,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:15:35,547 INFO L87 Difference]: Start difference. First operand 150 states and 463 transitions. Second operand 6 states. [2018-07-25 13:15:35,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:35,810 INFO L93 Difference]: Finished difference Result 246 states and 685 transitions. [2018-07-25 13:15:35,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:15:35,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-25 13:15:35,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:35,813 INFO L225 Difference]: With dead ends: 246 [2018-07-25 13:15:35,813 INFO L226 Difference]: Without dead ends: 242 [2018-07-25 13:15:35,814 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:15:35,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-07-25 13:15:35,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 150. [2018-07-25 13:15:35,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-07-25 13:15:35,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 463 transitions. [2018-07-25 13:15:35,874 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 463 transitions. Word has length 6 [2018-07-25 13:15:35,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:35,875 INFO L472 AbstractCegarLoop]: Abstraction has 150 states and 463 transitions. [2018-07-25 13:15:35,875 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:15:35,875 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 463 transitions. [2018-07-25 13:15:35,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:15:35,876 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:35,877 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:35,877 INFO L415 AbstractCegarLoop]: === Iteration 10 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:35,877 INFO L82 PathProgramCache]: Analyzing trace with hash -735598757, now seen corresponding path program 1 times [2018-07-25 13:15:35,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:35,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:35,909 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:35,910 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:15:35,910 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:15:35,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:15:35,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:15:35,912 INFO L87 Difference]: Start difference. First operand 150 states and 463 transitions. Second operand 8 states. [2018-07-25 13:15:36,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:36,323 INFO L93 Difference]: Finished difference Result 281 states and 789 transitions. [2018-07-25 13:15:36,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:15:36,323 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 13:15:36,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:36,326 INFO L225 Difference]: With dead ends: 281 [2018-07-25 13:15:36,327 INFO L226 Difference]: Without dead ends: 277 [2018-07-25 13:15:36,328 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:15:36,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-07-25 13:15:36,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 171. [2018-07-25 13:15:36,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-07-25 13:15:36,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 536 transitions. [2018-07-25 13:15:36,404 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 536 transitions. Word has length 8 [2018-07-25 13:15:36,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:36,405 INFO L472 AbstractCegarLoop]: Abstraction has 171 states and 536 transitions. [2018-07-25 13:15:36,405 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:15:36,405 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 536 transitions. [2018-07-25 13:15:36,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:15:36,406 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:36,406 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:36,407 INFO L415 AbstractCegarLoop]: === Iteration 11 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:36,407 INFO L82 PathProgramCache]: Analyzing trace with hash -735595843, now seen corresponding path program 1 times [2018-07-25 13:15:36,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:36,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:36,431 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:36,431 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:15:36,432 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:15:36,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:15:36,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:15:36,433 INFO L87 Difference]: Start difference. First operand 171 states and 536 transitions. Second operand 8 states. [2018-07-25 13:15:36,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:36,828 INFO L93 Difference]: Finished difference Result 260 states and 736 transitions. [2018-07-25 13:15:36,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:15:36,828 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 13:15:36,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:36,831 INFO L225 Difference]: With dead ends: 260 [2018-07-25 13:15:36,831 INFO L226 Difference]: Without dead ends: 256 [2018-07-25 13:15:36,832 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:15:36,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-07-25 13:15:36,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 167. [2018-07-25 13:15:36,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-07-25 13:15:36,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 523 transitions. [2018-07-25 13:15:36,914 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 523 transitions. Word has length 8 [2018-07-25 13:15:36,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:36,915 INFO L472 AbstractCegarLoop]: Abstraction has 167 states and 523 transitions. [2018-07-25 13:15:36,915 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:15:36,915 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 523 transitions. [2018-07-25 13:15:36,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:15:36,917 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:36,918 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:36,918 INFO L415 AbstractCegarLoop]: === Iteration 12 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:36,919 INFO L82 PathProgramCache]: Analyzing trace with hash -735391181, now seen corresponding path program 1 times [2018-07-25 13:15:36,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:36,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:36,953 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:36,954 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:15:36,954 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:15:36,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:15:36,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:15:36,956 INFO L87 Difference]: Start difference. First operand 167 states and 523 transitions. Second operand 8 states. [2018-07-25 13:15:37,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:37,494 INFO L93 Difference]: Finished difference Result 329 states and 931 transitions. [2018-07-25 13:15:37,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:15:37,494 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 13:15:37,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:37,498 INFO L225 Difference]: With dead ends: 329 [2018-07-25 13:15:37,498 INFO L226 Difference]: Without dead ends: 325 [2018-07-25 13:15:37,499 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:15:37,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-07-25 13:15:37,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 211. [2018-07-25 13:15:37,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-07-25 13:15:37,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 662 transitions. [2018-07-25 13:15:37,609 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 662 transitions. Word has length 8 [2018-07-25 13:15:37,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:37,609 INFO L472 AbstractCegarLoop]: Abstraction has 211 states and 662 transitions. [2018-07-25 13:15:37,610 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:15:37,610 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 662 transitions. [2018-07-25 13:15:37,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:15:37,611 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:37,611 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:37,611 INFO L415 AbstractCegarLoop]: === Iteration 13 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:37,612 INFO L82 PathProgramCache]: Analyzing trace with hash -717875034, now seen corresponding path program 1 times [2018-07-25 13:15:37,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:37,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:37,637 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:37,637 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:15:37,638 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:37,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:37,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:37,639 INFO L87 Difference]: Start difference. First operand 211 states and 662 transitions. Second operand 7 states. [2018-07-25 13:15:38,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:38,056 INFO L93 Difference]: Finished difference Result 339 states and 980 transitions. [2018-07-25 13:15:38,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:15:38,057 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 13:15:38,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:38,060 INFO L225 Difference]: With dead ends: 339 [2018-07-25 13:15:38,060 INFO L226 Difference]: Without dead ends: 335 [2018-07-25 13:15:38,061 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:15:38,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-07-25 13:15:38,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 233. [2018-07-25 13:15:38,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-07-25 13:15:38,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 731 transitions. [2018-07-25 13:15:38,174 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 731 transitions. Word has length 8 [2018-07-25 13:15:38,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:38,174 INFO L472 AbstractCegarLoop]: Abstraction has 233 states and 731 transitions. [2018-07-25 13:15:38,174 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:38,174 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 731 transitions. [2018-07-25 13:15:38,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:15:38,175 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:38,175 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:38,176 INFO L415 AbstractCegarLoop]: === Iteration 14 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:38,176 INFO L82 PathProgramCache]: Analyzing trace with hash -715996279, now seen corresponding path program 1 times [2018-07-25 13:15:38,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:38,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:38,200 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:38,200 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:15:38,203 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:38,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:38,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:38,204 INFO L87 Difference]: Start difference. First operand 233 states and 731 transitions. Second operand 7 states. [2018-07-25 13:15:38,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:38,665 INFO L93 Difference]: Finished difference Result 379 states and 1067 transitions. [2018-07-25 13:15:38,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:15:38,665 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 13:15:38,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:38,670 INFO L225 Difference]: With dead ends: 379 [2018-07-25 13:15:38,670 INFO L226 Difference]: Without dead ends: 375 [2018-07-25 13:15:38,671 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:15:38,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-07-25 13:15:38,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 227. [2018-07-25 13:15:38,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-07-25 13:15:38,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 710 transitions. [2018-07-25 13:15:38,799 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 710 transitions. Word has length 8 [2018-07-25 13:15:38,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:38,800 INFO L472 AbstractCegarLoop]: Abstraction has 227 states and 710 transitions. [2018-07-25 13:15:38,800 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:38,800 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 710 transitions. [2018-07-25 13:15:38,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:15:38,801 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:38,801 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:38,801 INFO L415 AbstractCegarLoop]: === Iteration 15 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:38,802 INFO L82 PathProgramCache]: Analyzing trace with hash -715993365, now seen corresponding path program 1 times [2018-07-25 13:15:38,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:38,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:38,818 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:38,818 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:15:38,818 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:38,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:38,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:38,819 INFO L87 Difference]: Start difference. First operand 227 states and 710 transitions. Second operand 7 states. [2018-07-25 13:15:39,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:39,234 INFO L93 Difference]: Finished difference Result 372 states and 1062 transitions. [2018-07-25 13:15:39,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:15:39,235 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 13:15:39,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:39,238 INFO L225 Difference]: With dead ends: 372 [2018-07-25 13:15:39,238 INFO L226 Difference]: Without dead ends: 368 [2018-07-25 13:15:39,239 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:15:39,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-07-25 13:15:39,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 225. [2018-07-25 13:15:39,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-07-25 13:15:39,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 702 transitions. [2018-07-25 13:15:39,358 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 702 transitions. Word has length 8 [2018-07-25 13:15:39,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:39,358 INFO L472 AbstractCegarLoop]: Abstraction has 225 states and 702 transitions. [2018-07-25 13:15:39,358 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:39,358 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 702 transitions. [2018-07-25 13:15:39,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:15:39,359 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:39,359 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:39,360 INFO L415 AbstractCegarLoop]: === Iteration 16 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:39,360 INFO L82 PathProgramCache]: Analyzing trace with hash -518810611, now seen corresponding path program 1 times [2018-07-25 13:15:39,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:39,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:39,373 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:39,374 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:15:39,374 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:39,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:39,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:39,375 INFO L87 Difference]: Start difference. First operand 225 states and 702 transitions. Second operand 7 states. [2018-07-25 13:15:39,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:39,767 INFO L93 Difference]: Finished difference Result 389 states and 1133 transitions. [2018-07-25 13:15:39,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:15:39,768 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 13:15:39,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:39,771 INFO L225 Difference]: With dead ends: 389 [2018-07-25 13:15:39,772 INFO L226 Difference]: Without dead ends: 385 [2018-07-25 13:15:39,773 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:15:39,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-07-25 13:15:39,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 267. [2018-07-25 13:15:39,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-07-25 13:15:39,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 829 transitions. [2018-07-25 13:15:39,926 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 829 transitions. Word has length 8 [2018-07-25 13:15:39,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:39,927 INFO L472 AbstractCegarLoop]: Abstraction has 267 states and 829 transitions. [2018-07-25 13:15:39,927 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:39,927 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 829 transitions. [2018-07-25 13:15:39,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:15:39,928 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:39,928 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:39,929 INFO L415 AbstractCegarLoop]: === Iteration 17 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:39,929 INFO L82 PathProgramCache]: Analyzing trace with hash -518394498, now seen corresponding path program 1 times [2018-07-25 13:15:39,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:39,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:39,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:39,945 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:39,945 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:15:39,945 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:39,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:39,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:39,946 INFO L87 Difference]: Start difference. First operand 267 states and 829 transitions. Second operand 7 states. [2018-07-25 13:15:40,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:40,414 INFO L93 Difference]: Finished difference Result 339 states and 995 transitions. [2018-07-25 13:15:40,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:15:40,415 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 13:15:40,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:40,418 INFO L225 Difference]: With dead ends: 339 [2018-07-25 13:15:40,418 INFO L226 Difference]: Without dead ends: 335 [2018-07-25 13:15:40,419 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:15:40,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-07-25 13:15:40,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 236. [2018-07-25 13:15:40,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-07-25 13:15:40,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 725 transitions. [2018-07-25 13:15:40,583 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 725 transitions. Word has length 8 [2018-07-25 13:15:40,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:40,583 INFO L472 AbstractCegarLoop]: Abstraction has 236 states and 725 transitions. [2018-07-25 13:15:40,583 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:40,583 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 725 transitions. [2018-07-25 13:15:40,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:15:40,584 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:40,584 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:40,585 INFO L415 AbstractCegarLoop]: === Iteration 18 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:40,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1075876758, now seen corresponding path program 1 times [2018-07-25 13:15:40,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:40,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:40,614 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:40,614 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-25 13:15:40,614 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:15:40,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:15:40,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:15:40,617 INFO L87 Difference]: Start difference. First operand 236 states and 725 transitions. Second operand 4 states. [2018-07-25 13:15:40,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:40,775 INFO L93 Difference]: Finished difference Result 405 states and 1236 transitions. [2018-07-25 13:15:40,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:15:40,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-07-25 13:15:40,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:40,778 INFO L225 Difference]: With dead ends: 405 [2018-07-25 13:15:40,778 INFO L226 Difference]: Without dead ends: 218 [2018-07-25 13:15:40,780 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:15:40,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-07-25 13:15:40,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 160. [2018-07-25 13:15:40,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-07-25 13:15:40,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 459 transitions. [2018-07-25 13:15:40,924 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 459 transitions. Word has length 8 [2018-07-25 13:15:40,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:40,924 INFO L472 AbstractCegarLoop]: Abstraction has 160 states and 459 transitions. [2018-07-25 13:15:40,924 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:15:40,924 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 459 transitions. [2018-07-25 13:15:40,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:15:40,925 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:40,925 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:40,926 INFO L415 AbstractCegarLoop]: === Iteration 19 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:40,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1049947056, now seen corresponding path program 1 times [2018-07-25 13:15:40,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:40,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:40,941 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:40,942 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:15:40,942 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:40,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:40,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:40,943 INFO L87 Difference]: Start difference. First operand 160 states and 459 transitions. Second operand 7 states. [2018-07-25 13:15:41,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:41,421 INFO L93 Difference]: Finished difference Result 346 states and 967 transitions. [2018-07-25 13:15:41,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:15:41,421 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 13:15:41,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:41,424 INFO L225 Difference]: With dead ends: 346 [2018-07-25 13:15:41,425 INFO L226 Difference]: Without dead ends: 342 [2018-07-25 13:15:41,425 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:15:41,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-07-25 13:15:41,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 144. [2018-07-25 13:15:41,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-07-25 13:15:41,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 415 transitions. [2018-07-25 13:15:41,592 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 415 transitions. Word has length 8 [2018-07-25 13:15:41,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:41,592 INFO L472 AbstractCegarLoop]: Abstraction has 144 states and 415 transitions. [2018-07-25 13:15:41,592 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:41,592 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 415 transitions. [2018-07-25 13:15:41,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:15:41,593 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:41,593 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:41,593 INFO L415 AbstractCegarLoop]: === Iteration 20 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:41,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1049062448, now seen corresponding path program 1 times [2018-07-25 13:15:41,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:41,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:41,607 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:41,607 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:15:41,608 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:41,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:41,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:41,609 INFO L87 Difference]: Start difference. First operand 144 states and 415 transitions. Second operand 7 states. [2018-07-25 13:15:42,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:42,305 INFO L93 Difference]: Finished difference Result 316 states and 819 transitions. [2018-07-25 13:15:42,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:15:42,305 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 13:15:42,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:42,308 INFO L225 Difference]: With dead ends: 316 [2018-07-25 13:15:42,308 INFO L226 Difference]: Without dead ends: 312 [2018-07-25 13:15:42,309 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:15:42,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-07-25 13:15:42,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 146. [2018-07-25 13:15:42,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-07-25 13:15:42,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 423 transitions. [2018-07-25 13:15:42,505 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 423 transitions. Word has length 8 [2018-07-25 13:15:42,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:42,505 INFO L472 AbstractCegarLoop]: Abstraction has 146 states and 423 transitions. [2018-07-25 13:15:42,505 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:42,505 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 423 transitions. [2018-07-25 13:15:42,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:15:42,506 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:42,506 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:42,507 INFO L415 AbstractCegarLoop]: === Iteration 21 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:42,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1049059534, now seen corresponding path program 1 times [2018-07-25 13:15:42,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:42,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:42,524 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:42,524 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:15:42,524 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:42,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:42,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:42,525 INFO L87 Difference]: Start difference. First operand 146 states and 423 transitions. Second operand 7 states. [2018-07-25 13:15:43,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:43,199 INFO L93 Difference]: Finished difference Result 314 states and 817 transitions. [2018-07-25 13:15:43,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:15:43,199 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 13:15:43,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:43,202 INFO L225 Difference]: With dead ends: 314 [2018-07-25 13:15:43,202 INFO L226 Difference]: Without dead ends: 310 [2018-07-25 13:15:43,203 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:15:43,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-07-25 13:15:43,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 168. [2018-07-25 13:15:43,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-07-25 13:15:43,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 488 transitions. [2018-07-25 13:15:43,417 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 488 transitions. Word has length 8 [2018-07-25 13:15:43,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:43,417 INFO L472 AbstractCegarLoop]: Abstraction has 168 states and 488 transitions. [2018-07-25 13:15:43,417 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:43,418 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 488 transitions. [2018-07-25 13:15:43,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:15:43,418 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:43,418 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:43,419 INFO L415 AbstractCegarLoop]: === Iteration 22 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:43,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1046475405, now seen corresponding path program 1 times [2018-07-25 13:15:43,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:43,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:43,433 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:43,433 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:15:43,434 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:43,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:43,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:43,437 INFO L87 Difference]: Start difference. First operand 168 states and 488 transitions. Second operand 7 states. [2018-07-25 13:15:44,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:44,139 INFO L93 Difference]: Finished difference Result 315 states and 832 transitions. [2018-07-25 13:15:44,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:15:44,139 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 13:15:44,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:44,144 INFO L225 Difference]: With dead ends: 315 [2018-07-25 13:15:44,144 INFO L226 Difference]: Without dead ends: 311 [2018-07-25 13:15:44,144 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:15:44,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-07-25 13:15:44,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 151. [2018-07-25 13:15:44,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-25 13:15:44,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 435 transitions. [2018-07-25 13:15:44,358 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 435 transitions. Word has length 8 [2018-07-25 13:15:44,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:44,358 INFO L472 AbstractCegarLoop]: Abstraction has 151 states and 435 transitions. [2018-07-25 13:15:44,358 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:44,358 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 435 transitions. [2018-07-25 13:15:44,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:15:44,359 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:44,359 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:44,360 INFO L415 AbstractCegarLoop]: === Iteration 23 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:44,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1117485617, now seen corresponding path program 1 times [2018-07-25 13:15:44,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:44,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:44,374 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:44,374 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:15:44,374 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:44,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:44,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:44,375 INFO L87 Difference]: Start difference. First operand 151 states and 435 transitions. Second operand 7 states. [2018-07-25 13:15:45,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:45,127 INFO L93 Difference]: Finished difference Result 329 states and 898 transitions. [2018-07-25 13:15:45,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:15:45,128 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 13:15:45,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:45,130 INFO L225 Difference]: With dead ends: 329 [2018-07-25 13:15:45,130 INFO L226 Difference]: Without dead ends: 325 [2018-07-25 13:15:45,131 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:15:45,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-07-25 13:15:45,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 173. [2018-07-25 13:15:45,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-25 13:15:45,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 504 transitions. [2018-07-25 13:15:45,357 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 504 transitions. Word has length 8 [2018-07-25 13:15:45,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:45,358 INFO L472 AbstractCegarLoop]: Abstraction has 173 states and 504 transitions. [2018-07-25 13:15:45,358 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:45,358 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 504 transitions. [2018-07-25 13:15:45,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:15:45,358 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:45,359 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:45,359 INFO L415 AbstractCegarLoop]: === Iteration 24 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:45,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1119667118, now seen corresponding path program 1 times [2018-07-25 13:15:45,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:45,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:45,375 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:45,375 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:15:45,375 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:45,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:45,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:45,376 INFO L87 Difference]: Start difference. First operand 173 states and 504 transitions. Second operand 7 states. [2018-07-25 13:15:46,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:46,127 INFO L93 Difference]: Finished difference Result 301 states and 792 transitions. [2018-07-25 13:15:46,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:15:46,127 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 13:15:46,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:46,130 INFO L225 Difference]: With dead ends: 301 [2018-07-25 13:15:46,130 INFO L226 Difference]: Without dead ends: 297 [2018-07-25 13:15:46,131 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:15:46,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-07-25 13:15:46,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 166. [2018-07-25 13:15:46,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-07-25 13:15:46,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 479 transitions. [2018-07-25 13:15:46,383 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 479 transitions. Word has length 8 [2018-07-25 13:15:46,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:46,384 INFO L472 AbstractCegarLoop]: Abstraction has 166 states and 479 transitions. [2018-07-25 13:15:46,384 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:46,384 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 479 transitions. [2018-07-25 13:15:46,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:15:46,385 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:46,385 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:46,385 INFO L415 AbstractCegarLoop]: === Iteration 25 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:46,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1119664204, now seen corresponding path program 1 times [2018-07-25 13:15:46,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:46,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:46,402 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:46,402 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:15:46,402 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:46,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:46,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:46,403 INFO L87 Difference]: Start difference. First operand 166 states and 479 transitions. Second operand 7 states. [2018-07-25 13:15:47,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:47,101 INFO L93 Difference]: Finished difference Result 321 states and 842 transitions. [2018-07-25 13:15:47,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:15:47,102 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 13:15:47,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:47,104 INFO L225 Difference]: With dead ends: 321 [2018-07-25 13:15:47,104 INFO L226 Difference]: Without dead ends: 317 [2018-07-25 13:15:47,105 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:15:47,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-07-25 13:15:47,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 152. [2018-07-25 13:15:47,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-07-25 13:15:47,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 428 transitions. [2018-07-25 13:15:47,311 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 428 transitions. Word has length 8 [2018-07-25 13:15:47,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:47,311 INFO L472 AbstractCegarLoop]: Abstraction has 152 states and 428 transitions. [2018-07-25 13:15:47,312 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:47,312 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 428 transitions. [2018-07-25 13:15:47,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:15:47,312 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:47,313 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:47,313 INFO L415 AbstractCegarLoop]: === Iteration 26 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:47,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1958270560, now seen corresponding path program 1 times [2018-07-25 13:15:47,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:47,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:47,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 13:15:47,335 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:47,335 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-25 13:15:47,335 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:15:47,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:15:47,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:15:47,336 INFO L87 Difference]: Start difference. First operand 152 states and 428 transitions. Second operand 4 states. [2018-07-25 13:15:47,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:47,649 INFO L93 Difference]: Finished difference Result 288 states and 788 transitions. [2018-07-25 13:15:47,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:15:47,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-07-25 13:15:47,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:47,651 INFO L225 Difference]: With dead ends: 288 [2018-07-25 13:15:47,652 INFO L226 Difference]: Without dead ends: 137 [2018-07-25 13:15:47,652 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:15:47,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-25 13:15:47,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 124. [2018-07-25 13:15:47,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-07-25 13:15:47,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 302 transitions. [2018-07-25 13:15:47,906 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 302 transitions. Word has length 10 [2018-07-25 13:15:47,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:47,906 INFO L472 AbstractCegarLoop]: Abstraction has 124 states and 302 transitions. [2018-07-25 13:15:47,906 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:15:47,906 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 302 transitions. [2018-07-25 13:15:47,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:15:47,907 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:47,907 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:47,908 INFO L415 AbstractCegarLoop]: === Iteration 27 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:47,908 INFO L82 PathProgramCache]: Analyzing trace with hash -161849015, now seen corresponding path program 1 times [2018-07-25 13:15:47,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:47,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 13:15:47,921 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:47,921 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-25 13:15:47,922 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:15:47,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:15:47,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:15:47,922 INFO L87 Difference]: Start difference. First operand 124 states and 302 transitions. Second operand 4 states. [2018-07-25 13:15:48,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:48,189 INFO L93 Difference]: Finished difference Result 260 states and 641 transitions. [2018-07-25 13:15:48,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:15:48,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-07-25 13:15:48,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:48,191 INFO L225 Difference]: With dead ends: 260 [2018-07-25 13:15:48,191 INFO L226 Difference]: Without dead ends: 137 [2018-07-25 13:15:48,191 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:15:48,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-25 13:15:48,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 65. [2018-07-25 13:15:48,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 13:15:48,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 145 transitions. [2018-07-25 13:15:48,350 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 145 transitions. Word has length 10 [2018-07-25 13:15:48,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:48,350 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 145 transitions. [2018-07-25 13:15:48,351 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:15:48,351 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 145 transitions. [2018-07-25 13:15:48,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:15:48,351 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:48,351 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:48,352 INFO L415 AbstractCegarLoop]: === Iteration 28 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:48,352 INFO L82 PathProgramCache]: Analyzing trace with hash 564711112, now seen corresponding path program 1 times [2018-07-25 13:15:48,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:48,383 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:48,383 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:48,383 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:15:48,384 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:15:48,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:15:48,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:15:48,384 INFO L87 Difference]: Start difference. First operand 65 states and 145 transitions. Second operand 10 states. [2018-07-25 13:15:49,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:49,152 INFO L93 Difference]: Finished difference Result 201 states and 440 transitions. [2018-07-25 13:15:49,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:15:49,153 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-07-25 13:15:49,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:49,154 INFO L225 Difference]: With dead ends: 201 [2018-07-25 13:15:49,154 INFO L226 Difference]: Without dead ends: 197 [2018-07-25 13:15:49,155 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:15:49,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-07-25 13:15:49,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 70. [2018-07-25 13:15:49,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-07-25 13:15:49,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 157 transitions. [2018-07-25 13:15:49,331 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 157 transitions. Word has length 13 [2018-07-25 13:15:49,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:49,331 INFO L472 AbstractCegarLoop]: Abstraction has 70 states and 157 transitions. [2018-07-25 13:15:49,331 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:15:49,331 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 157 transitions. [2018-07-25 13:15:49,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:15:49,332 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:49,332 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:49,332 INFO L415 AbstractCegarLoop]: === Iteration 29 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:49,333 INFO L82 PathProgramCache]: Analyzing trace with hash -677740153, now seen corresponding path program 1 times [2018-07-25 13:15:49,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:49,362 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:49,362 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:49,363 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:15:49,363 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:15:49,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:15:49,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:15:49,364 INFO L87 Difference]: Start difference. First operand 70 states and 157 transitions. Second operand 10 states. [2018-07-25 13:15:50,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:50,319 INFO L93 Difference]: Finished difference Result 197 states and 439 transitions. [2018-07-25 13:15:50,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 13:15:50,320 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-07-25 13:15:50,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:50,322 INFO L225 Difference]: With dead ends: 197 [2018-07-25 13:15:50,322 INFO L226 Difference]: Without dead ends: 195 [2018-07-25 13:15:50,323 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:15:50,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-07-25 13:15:50,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 67. [2018-07-25 13:15:50,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-25 13:15:50,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 151 transitions. [2018-07-25 13:15:50,499 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 151 transitions. Word has length 13 [2018-07-25 13:15:50,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:50,499 INFO L472 AbstractCegarLoop]: Abstraction has 67 states and 151 transitions. [2018-07-25 13:15:50,499 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:15:50,499 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 151 transitions. [2018-07-25 13:15:50,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:15:50,500 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:50,500 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:50,500 INFO L415 AbstractCegarLoop]: === Iteration 30 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:50,500 INFO L82 PathProgramCache]: Analyzing trace with hash -599447802, now seen corresponding path program 1 times [2018-07-25 13:15:50,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:50,537 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:50,537 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:50,537 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:15:50,537 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:15:50,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:15:50,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:15:50,538 INFO L87 Difference]: Start difference. First operand 67 states and 151 transitions. Second operand 11 states. [2018-07-25 13:15:51,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:51,677 INFO L93 Difference]: Finished difference Result 179 states and 401 transitions. [2018-07-25 13:15:51,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 13:15:51,677 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2018-07-25 13:15:51,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:51,677 INFO L225 Difference]: With dead ends: 179 [2018-07-25 13:15:51,677 INFO L226 Difference]: Without dead ends: 0 [2018-07-25 13:15:51,678 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=212, Invalid=780, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:15:51,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-25 13:15:51,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-25 13:15:51,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-25 13:15:51,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-25 13:15:51,679 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-07-25 13:15:51,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:51,680 INFO L472 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-25 13:15:51,680 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:15:51,680 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-25 13:15:51,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-25 13:15:51,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-25 13:15:53,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:15:57,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:15:58,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:15:58,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:15:58,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:15:58,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:00,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:01,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:01,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:01,592 WARN L169 SmtUtils]: Spent 9.89 s on a formula simplification. DAG size of input: 665 DAG size of output: 476 [2018-07-25 13:16:01,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:01,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:02,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:02,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:02,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:03,609 WARN L169 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 575 DAG size of output: 432 [2018-07-25 13:16:03,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:03,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:03,755 WARN L169 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 141 [2018-07-25 13:16:03,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:03,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:03,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:03,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:03,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:04,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:04,815 WARN L169 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 573 DAG size of output: 427 [2018-07-25 13:16:04,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:04,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:04,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:04,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:04,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:04,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:04,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:05,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:05,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:05,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:05,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:05,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:05,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:05,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:05,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:05,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:05,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:05,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:06,400 WARN L169 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 764 DAG size of output: 550 [2018-07-25 13:16:06,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:06,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:06,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:06,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:06,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:06,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:06,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:07,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:07,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:08,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:08,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:08,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:09,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:09,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:09,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:10,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:10,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:10,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:10,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:11,136 WARN L169 SmtUtils]: Spent 4.73 s on a formula simplification. DAG size of input: 1006 DAG size of output: 723 [2018-07-25 13:16:11,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:11,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:11,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:11,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:11,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:11,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:11,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:11,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:11,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:11,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:11,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:11,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:11,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:11,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:12,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:12,981 WARN L169 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 670 DAG size of output: 488 [2018-07-25 13:16:12,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:12,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:12,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:13,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:13,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:13,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:13,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:13,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:13,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:13,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:14,077 WARN L169 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 513 DAG size of output: 356 [2018-07-25 13:16:14,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:14,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:14,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:14,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:14,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:15,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:16:18,243 WARN L169 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 655 DAG size of output: 522 [2018-07-25 13:16:25,450 WARN L169 SmtUtils]: Spent 7.20 s on a formula simplification. DAG size of input: 465 DAG size of output: 50 [2018-07-25 13:16:27,715 WARN L169 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 394 DAG size of output: 43 [2018-07-25 13:16:28,001 WARN L169 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 39 [2018-07-25 13:16:29,262 WARN L169 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 394 DAG size of output: 79 [2018-07-25 13:16:31,244 WARN L169 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 504 DAG size of output: 84 [2018-07-25 13:16:35,148 WARN L169 SmtUtils]: Spent 3.90 s on a formula simplification. DAG size of input: 692 DAG size of output: 79 [2018-07-25 13:16:36,844 WARN L169 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 462 DAG size of output: 55 [2018-07-25 13:16:37,538 WARN L169 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 51 [2018-07-25 13:16:39,885 WARN L169 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 501 DAG size of output: 54 [2018-07-25 13:16:39,890 INFO L418 ceAbstractionStarter]: At program point L192(lines 72 210) the Hoare annotation is: (let ((.cse10 (+ product__local__threadpooling_working_1 2)) (.cse20 (+ product__local__threadpooling_working_0 1)) (.cse19 (+ product__local__threadpooling_end_1 1)) (.cse21 (+ product__local__threadpooling_i_0 1)) (.cse1 (+ product__local__threadpooling_end_0 1))) (let ((.cse3 (= product__local__threadpooling_end_1 product__global_next)) (.cse4 (<= (+ product__local__threadpooling_working_1 1) product__global_next)) (.cse8 (<= .cse1 product__global_next)) (.cse11 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse0 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1))) (.cse15 (<= .cse21 product__local__threadpooling_end_0)) (.cse18 (<= .cse19 product__local__threadpooling_working_0)) (.cse12 (<= .cse19 product__local__threadpooling_i_0)) (.cse17 (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)) (.cse2 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))) (.cse14 (= product__local__threadpooling_end_0 product__global_next)) (.cse6 (<= product__local__threadpooling_end_0 .cse21)) (.cse5 (<= .cse20 product__global_next)) (.cse7 (<= .cse20 product__local__threadpooling_i_1)) (.cse13 (<= .cse10 product__global_next))) (or (let ((.cse9 (<= (+ product__local__threadpooling_working_0 2) product__global_next))) (or (and .cse0 (and (and (<= .cse1 product__local__threadpooling_i_1) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))) .cse8)) (and (and (= product__local__threadpooling_end_0 product__local__threadpooling_working_1) .cse3 .cse6 (= product__local__threadpooling_i_1 product__local__threadpooling_end_0)) .cse0 .cse9 .cse8) (and (and (or (and (<= .cse10 product__local__threadpooling_i_0) .cse6 (and .cse11 .cse12)) (and .cse6 (and .cse11 (= product__local__threadpooling_end_1 product__local__threadpooling_i_0)) .cse13)) .cse14 .cse9) .cse0 .cse15))) (let ((.cse16 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0))) (or (and .cse0 (and (and .cse11 .cse3) .cse16 .cse4 .cse5 .cse7) .cse8) (and .cse0 (and (= product__global_next product__local__threadpooling_end_0) (or (and .cse2 .cse16 .cse17) (and .cse16 .cse11 .cse18)) .cse5) (<= .cse10 product__local__threadpooling_end_0)))) (and (and .cse0 .cse15 (or (and (or (and .cse2 .cse18) (and .cse2 .cse12 .cse17)) .cse5 .cse14 .cse6) (and .cse2 (and (<= .cse19 product__local__threadpooling_end_0) .cse14 .cse6) .cse5 .cse7))) .cse13)))) [2018-07-25 13:16:39,891 INFO L418 ceAbstractionStarter]: At program point L209(lines 50 209) the Hoare annotation is: (let ((.cse11 (+ product__local__threadpooling_working_0 1))) (let ((.cse7 (<= .cse11 product__local__threadpooling_i_1)) (.cse3 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse2 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))) (.cse6 (<= .cse11 product__global_next)) (.cse8 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1)))) (or (and (let ((.cse1 (+ product__local__threadpooling_working_0 2))) (let ((.cse0 (let ((.cse4 (= product__local__threadpooling_end_1 product__global_next)) (.cse5 (<= (+ product__local__threadpooling_working_1 1) product__global_next))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse5 (<= .cse1 product__local__threadpooling_working_1)))))) (or (and .cse0 (<= (+ product__local__threadpooling_end_0 1) product__global_next)) (and .cse0 (<= .cse1 product__global_next))))) .cse8) (and (let ((.cse10 (+ product__local__threadpooling_end_1 1))) (let ((.cse9 (and (<= .cse10 product__local__threadpooling_end_0) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)) (<= .cse10 product__local__threadpooling_i_0)))) (or (and .cse3 .cse6 .cse9 .cse7) (and .cse3 (or (and .cse2 (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)) (and .cse9 (<= .cse10 product__local__threadpooling_working_0))) .cse6)))) .cse8 (= product__local__threadpooling_end_0 product__global_next) (<= (+ product__local__threadpooling_working_1 2) product__global_next))))) [2018-07-25 13:16:39,893 INFO L418 ceAbstractionStarter]: At program point L234(lines 97 234) the Hoare annotation is: (let ((.cse25 (+ product__local__threadpooling_working_1 2))) (let ((.cse22 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))) (.cse20 (<= .cse25 product__local__threadpooling_i_0))) (let ((.cse10 (<= .cse25 product__local__threadpooling_working_0)) (.cse15 (and .cse22 .cse20)) (.cse9 (<= .cse25 product__global_next)) (.cse23 (= product__local__threadpooling_end_1 product__global_next)) (.cse21 (+ product__local__threadpooling_working_1 1)) (.cse2 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse24 (+ product__local__threadpooling_working_0 1))) (let ((.cse8 (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_end_0)) (.cse11 (= product__local__threadpooling_end_0 product__global_next)) (.cse7 (<= .cse24 product__local__threadpooling_i_1)) (.cse3 (and .cse23 (<= .cse21 product__global_next) .cse2)) (.cse6 (<= .cse24 product__global_next)) (.cse1 (<= (+ product__local__threadpooling_end_0 1) product__global_next)) (.cse5 (or (and .cse10 .cse15 .cse9) (and (<= .cse21 product__local__threadpooling_i_0) (and .cse22 .cse23) .cse9)))) (or (let ((.cse0 (let ((.cse4 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0))) (or (and (or (and .cse3 .cse4) (and .cse4 .cse5)) .cse6 .cse7) (and (or (and .cse8 .cse9) .cse10) .cse4 .cse6 .cse11))))) (or (and .cse0 .cse1) (and (= product__global_next product__local__threadpooling_end_0) .cse0 .cse2))) (let ((.cse19 (+ product__local__threadpooling_i_0 1))) (let ((.cse16 (<= product__local__threadpooling_end_0 .cse19)) (.cse13 (<= (+ product__local__threadpooling_working_0 2) product__global_next))) (let ((.cse17 (and .cse20 .cse13)) (.cse12 (and .cse16 .cse5)) (.cse14 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse18 (<= .cse19 product__local__threadpooling_end_0))) (or (and (and (and .cse12 .cse13) .cse1) .cse14) (and (or (and (or (and (and .cse8 .cse2) .cse9) .cse15) .cse6 .cse16) (and .cse17 .cse16)) .cse11 .cse18) (and (and (or (and (and (= product__global_next product__local__threadpooling_end_1) .cse17) .cse16) (and .cse6 .cse12 .cse7) (and (and .cse3 .cse6 .cse16) (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)))) .cse1) .cse14 .cse18)))))))))) [2018-07-25 13:16:39,893 INFO L425 ceAbstractionStarter]: At program point productENTRY(lines 3 236) the Hoare annotation is: true [2018-07-25 13:16:39,893 INFO L422 ceAbstractionStarter]: For program point productFINAL(lines 3 236) no Hoare annotation was computed. [2018-07-25 13:16:39,894 INFO L422 ceAbstractionStarter]: For program point L119(lines 119 124) no Hoare annotation was computed. [2018-07-25 13:16:39,894 INFO L422 ceAbstractionStarter]: For program point L95(lines 95 190) no Hoare annotation was computed. [2018-07-25 13:16:39,894 INFO L418 ceAbstractionStarter]: At program point productErr0ASSERT_VIOLATIONASSERT(line 60) the Hoare annotation is: false [2018-07-25 13:16:39,895 INFO L418 ceAbstractionStarter]: At program point L203(lines 143 203) the Hoare annotation is: (let ((.cse5 (+ product__local__threadpooling_i_0 1)) (.cse3 (+ product__local__threadpooling_working_0 1))) (let ((.cse1 (<= .cse3 product__global_next)) (.cse0 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1))) (.cse4 (<= .cse5 product__local__threadpooling_end_0)) (.cse2 (<= product__local__threadpooling_end_0 .cse5))) (or (and .cse0 (and (and .cse1 (and (and (= product__local__threadpooling_end_1 product__global_next) (<= (+ product__local__threadpooling_working_1 1) product__global_next) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) .cse2) (<= .cse3 product__local__threadpooling_i_1)) (<= (+ product__local__threadpooling_end_0 1) product__global_next)) .cse4) (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) .cse1 .cse0 (= product__local__threadpooling_end_0 product__global_next) .cse4 (or (and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (= product__local__threadpooling_end_1 product__local__threadpooling_working_0) .cse2) (and (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_working_0) .cse2)) (<= (+ product__local__threadpooling_working_1 2) product__global_next))))) [2018-07-25 13:16:39,895 INFO L422 ceAbstractionStarter]: For program point L154(lines 154 159) no Hoare annotation was computed. [2018-07-25 13:16:39,896 INFO L418 ceAbstractionStarter]: At program point L121(lines 17 229) the Hoare annotation is: (let ((.cse1 (<= (+ product__local__threadpooling_working_0 2) product__global_next))) (let ((.cse0 (let ((.cse10 (+ product__local__threadpooling_working_1 1)) (.cse13 (+ product__local__threadpooling_working_1 2))) (let ((.cse4 (<= .cse13 product__global_next)) (.cse2 (= product__local__threadpooling_end_1 product__global_next)) (.cse3 (<= .cse10 product__global_next))) (or (or (and .cse2 .cse3 .cse1) (and .cse1 .cse4)) (let ((.cse9 (= product__local__threadpooling_end_0 product__global_next)) (.cse8 (+ product__local__threadpooling_working_0 1))) (let ((.cse5 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse6 (<= .cse8 product__global_next)) (.cse7 (let ((.cse12 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)))) (or (and (<= .cse10 product__local__threadpooling_i_0) (or (and (let ((.cse11 (+ product__local__threadpooling_end_1 1))) (and (<= .cse11 product__local__threadpooling_end_0) .cse12 (<= .cse11 product__local__threadpooling_i_0) .cse9)) .cse4) (and (<= .cse13 product__local__threadpooling_working_0) (<= .cse13 product__local__threadpooling_i_0) .cse4))) (and .cse12 .cse2 .cse3))))) (or (and .cse5 .cse6 .cse7 (<= .cse8 product__local__threadpooling_i_1)) (and .cse5 .cse6 .cse7 .cse9))))))))) (or (and .cse0 .cse1) (and .cse0 (<= (+ product__local__threadpooling_end_0 1) product__global_next)) (and (= product__global_next product__local__threadpooling_end_0) .cse0)))) [2018-07-25 13:16:39,896 INFO L418 ceAbstractionStarter]: At program point productErr3ASSERT_VIOLATIONASSERT(line 176) the Hoare annotation is: false [2018-07-25 13:16:39,896 INFO L422 ceAbstractionStarter]: For program point L196(lines 196 201) no Hoare annotation was computed. [2018-07-25 13:16:39,896 INFO L418 ceAbstractionStarter]: At program point productErr2ASSERT_VIOLATIONASSERT(line 171) the Hoare annotation is: false [2018-07-25 13:16:39,897 INFO L422 ceAbstractionStarter]: For program point productEXIT(lines 3 236) no Hoare annotation was computed. [2018-07-25 13:16:39,897 INFO L418 ceAbstractionStarter]: At program point productErr5ASSERT_VIOLATIONASSERT(line 186) the Hoare annotation is: false [2018-07-25 13:16:39,897 INFO L418 ceAbstractionStarter]: At program point productErr1ASSERT_VIOLATIONASSERT(line 82) the Hoare annotation is: false [2018-07-25 13:16:39,898 INFO L418 ceAbstractionStarter]: At program point L156(lines 126 185) the Hoare annotation is: (let ((.cse10 (+ product__local__threadpooling_i_0 1)) (.cse11 (+ product__local__threadpooling_working_1 2))) (let ((.cse8 (<= .cse11 product__local__threadpooling_working_0)) (.cse6 (+ product__local__threadpooling_working_1 1)) (.cse7 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))) (.cse5 (<= product__local__threadpooling_end_0 .cse10))) (let ((.cse2 (or (and (and .cse8 (<= .cse11 product__local__threadpooling_i_0) (<= .cse11 product__global_next)) .cse5) (and (and (<= .cse6 product__global_next) (and (= product__local__threadpooling_end_1 product__global_next) .cse7)) .cse5))) (.cse1 (<= (+ product__local__threadpooling_end_0 1) product__global_next)) (.cse9 (<= .cse10 product__local__threadpooling_end_0))) (or (and (let ((.cse0 (let ((.cse4 (+ product__local__threadpooling_working_0 1))) (let ((.cse3 (<= .cse4 product__global_next))) (or (and .cse2 .cse3 (<= .cse4 product__local__threadpooling_i_1)) (and (and .cse3 .cse5 (or (and (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_end_0) (<= .cse6 product__local__threadpooling_i_0) .cse7) .cse8)) (= product__local__threadpooling_end_0 product__global_next))))))) (or (and .cse0 .cse1) (and (= product__global_next product__local__threadpooling_end_0) .cse0))) .cse9) (and (and (and (<= (+ product__local__threadpooling_working_0 2) product__global_next) .cse2) .cse1) (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1) .cse9))))) [2018-07-25 13:16:39,899 INFO L418 ceAbstractionStarter]: At program point L214(lines 161 214) the Hoare annotation is: (let ((.cse8 (+ product__local__threadpooling_i_0 1)) (.cse4 (+ product__local__threadpooling_working_0 1))) (let ((.cse1 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))) (.cse2 (<= .cse4 product__global_next)) (.cse0 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1))) (.cse7 (= product__local__threadpooling_end_0 product__global_next)) (.cse3 (<= product__local__threadpooling_end_0 .cse8)) (.cse5 (<= .cse8 product__local__threadpooling_end_0)) (.cse6 (<= (+ product__local__threadpooling_working_1 2) product__global_next))) (or (or (and .cse0 (and (and .cse1 (= product__local__threadpooling_end_1 product__global_next) (<= (+ product__local__threadpooling_working_1 1) product__global_next) .cse2 .cse3 (<= .cse4 product__local__threadpooling_i_1)) (<= (+ product__local__threadpooling_end_0 1) product__global_next)) .cse5) (and .cse2 .cse0 (and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (= product__local__threadpooling_end_1 product__local__threadpooling_working_0) .cse3 .cse6) .cse7)) (and .cse1 .cse2 .cse0 .cse7 .cse3 (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_working_0) .cse5 .cse6)))) [2018-07-25 13:16:39,900 INFO L418 ceAbstractionStarter]: At program point L198(lines 32 219) the Hoare annotation is: (let ((.cse10 (+ product__local__threadpooling_working_0 1))) (let ((.cse5 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1))) (.cse3 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse6 (<= .cse10 product__global_next)) (.cse4 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse9 (<= .cse10 product__local__threadpooling_i_1)) (.cse8 (<= (+ product__local__threadpooling_working_1 2) product__global_next))) (or (and (let ((.cse1 (+ product__local__threadpooling_working_0 2))) (and (let ((.cse0 (= product__local__threadpooling_end_1 product__global_next)) (.cse2 (<= (+ product__local__threadpooling_working_1 1) product__global_next))) (or (and (and .cse0 (<= .cse1 product__local__threadpooling_i_1)) .cse2) (and .cse3 (and .cse4 .cse0 .cse2)))) (<= .cse1 product__global_next))) .cse5) (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) .cse5 (and (= product__global_next product__local__threadpooling_end_0) (let ((.cse7 (+ product__local__threadpooling_end_1 1))) (or (and .cse3 .cse6 (and (or (<= .cse7 product__local__threadpooling_working_0) (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)) .cse8)) (and .cse3 .cse6 (and (<= .cse7 product__local__threadpooling_end_0) .cse8) .cse9))))) (and (and .cse5 (and .cse3 .cse6 (and (= product__global_next product__local__threadpooling_end_1) .cse4) .cse9) (<= (+ product__local__threadpooling_end_0 1) product__global_next)) .cse8)))) [2018-07-25 13:16:39,900 INFO L422 ceAbstractionStarter]: For program point L207(lines 207 212) no Hoare annotation was computed. [2018-07-25 13:16:39,900 INFO L418 ceAbstractionStarter]: At program point productErr4ASSERT_VIOLATIONASSERT(line 181) the Hoare annotation is: false [2018-07-25 13:16:39,901 INFO L418 ceAbstractionStarter]: At program point L224(lines 84 224) the Hoare annotation is: (let ((.cse17 (+ product__local__threadpooling_end_0 1)) (.cse20 (+ product__local__threadpooling_i_0 1)) (.cse21 (+ product__local__threadpooling_working_0 2)) (.cse23 (+ product__local__threadpooling_working_0 1)) (.cse13 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse18 (= product__local__threadpooling_end_1 product__global_next)) (.cse19 (+ product__local__threadpooling_working_1 1)) (.cse22 (+ product__local__threadpooling_working_1 2)) (.cse12 (+ product__local__threadpooling_end_1 1))) (let ((.cse14 (<= .cse12 product__local__threadpooling_working_0)) (.cse7 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse15 (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)) (.cse6 (= product__local__threadpooling_end_0 product__global_next)) (.cse16 (<= .cse22 product__global_next)) (.cse4 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1))) (.cse8 (and .cse13 .cse18 (<= .cse19 product__global_next))) (.cse9 (<= .cse23 product__global_next)) (.cse2 (<= .cse21 product__global_next)) (.cse10 (<= .cse23 product__local__threadpooling_i_1)) (.cse0 (<= .cse22 product__local__threadpooling_i_0)) (.cse1 (<= .cse21 product__local__threadpooling_i_1)) (.cse3 (<= product__local__threadpooling_end_0 .cse20)) (.cse11 (<= .cse17 product__global_next)) (.cse5 (<= .cse20 product__local__threadpooling_end_0))) (or (and (and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (and (and (and .cse0 .cse1 .cse2) .cse3) .cse4 .cse5)) .cse6) (and (and (and .cse7 .cse8) .cse9 .cse10) .cse4 .cse11) (and (and .cse4 (and (= product__global_next product__local__threadpooling_end_0) (or (and .cse9 (and (<= .cse12 product__local__threadpooling_end_0) .cse13 .cse3) .cse10) (and .cse9 (or (and .cse13 .cse14) (and .cse13 (<= .cse12 product__local__threadpooling_i_0) .cse15)) .cse3))) .cse5) .cse16) (and .cse9 .cse4 (or (and .cse7 .cse13 .cse6 .cse14) (and .cse7 .cse13 .cse15 .cse6)) .cse16) (and .cse4 (or (and (and (<= .cse17 product__local__threadpooling_i_1) (or (and (and .cse8 .cse9 .cse3 .cse10) (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))) (and (and .cse0 .cse18 .cse2) .cse3))) .cse11) (and (and (or (and .cse3 (and .cse13 .cse18 (<= .cse19 product__local__threadpooling_i_0)) .cse10) (and (and .cse0 .cse18 .cse1) .cse3)) (= product__local__threadpooling_i_1 product__local__threadpooling_end_0)) .cse11)) .cse5)))) [2018-07-25 13:16:39,901 INFO L422 ceAbstractionStarter]: For program point L43(lines 43 48) no Hoare annotation was computed. [2018-07-25 13:16:39,937 INFO L202 PluginConnector]: Adding new model threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:16:39 BoogieIcfgContainer [2018-07-25 13:16:39,941 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:16:39,942 INFO L168 Benchmark]: Toolchain (without parser) took 67753.48 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.4 GB). Free memory was 1.5 GB in the beginning and 987.4 MB in the end (delta: 498.3 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-07-25 13:16:39,943 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:16:39,945 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.63 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:16:39,945 INFO L168 Benchmark]: Boogie Preprocessor took 38.48 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:16:39,946 INFO L168 Benchmark]: RCFGBuilder took 354.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-25 13:16:39,947 INFO L168 Benchmark]: TraceAbstraction took 67310.19 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.4 GB). Free memory was 1.5 GB in the beginning and 987.4 MB in the end (delta: 487.7 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-07-25 13:16:39,952 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.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.63 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.48 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 354.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 67310.19 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.4 GB). Free memory was 1.5 GB in the beginning and 987.4 MB in the end (delta: 487.7 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 171]: 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: 60]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 181]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 176]: 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: 97]: Loop Invariant Derived loop invariant: (((((((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_1 + 1 <= _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) || (_local__threadpooling_end_0 <= _local__threadpooling_i_0 && (((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && !(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 2 <= _global_next)))) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || (((((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && _local__threadpooling_working_1 + 2 <= _global_next) || _local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_0 == _global_next)) && _local__threadpooling_end_0 + 1 <= _global_next) || ((_global_next == _local__threadpooling_end_0 && (((((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_1 + 1 <= _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) || (_local__threadpooling_end_0 <= _local__threadpooling_i_0 && (((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && !(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 2 <= _global_next)))) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || (((((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && _local__threadpooling_working_1 + 2 <= _global_next) || _local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_0 == _global_next))) && !(_local__threadpooling_working_0 == _local__threadpooling_working_1))) || (((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1 && (((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && !(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 2 <= _global_next))) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) || ((((((((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_working_1 + 2 <= _global_next) || (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0)) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || ((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1)) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0)) || (((((((_global_next == _local__threadpooling_end_1 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || ((_local__threadpooling_working_0 + 1 <= _global_next && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1 && (((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && !(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 2 <= _global_next))) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1)) || (((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_1 + 1 <= _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0))) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) || (_local__threadpooling_working_0 + 2 <= _global_next && _local__threadpooling_working_1 + 2 <= _global_next)) || (((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 1 <= _global_next) && ((_local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0 && (((((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next))) || ((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next))) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || (((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 1 <= _global_next) && ((_local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0 && (((((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next))) || ((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next))) && _local__threadpooling_end_0 == _global_next)) && _local__threadpooling_working_0 + 2 <= _global_next) || (((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) || (_local__threadpooling_working_0 + 2 <= _global_next && _local__threadpooling_working_1 + 2 <= _global_next)) || (((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 1 <= _global_next) && ((_local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0 && (((((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next))) || ((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next))) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || (((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 1 <= _global_next) && ((_local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0 && (((((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next))) || ((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next))) && _local__threadpooling_end_0 == _global_next)) && _local__threadpooling_end_0 + 1 <= _global_next)) || (_global_next == _local__threadpooling_end_0 && ((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) || (_local__threadpooling_working_0 + 2 <= _global_next && _local__threadpooling_working_1 + 2 <= _global_next)) || (((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 1 <= _global_next) && ((_local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0 && (((((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next))) || ((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next))) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || (((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 1 <= _global_next) && ((_local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0 && (((((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next))) || ((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next))) && _local__threadpooling_end_0 == _global_next))) - InvariantResult [Line: 143]: Loop Invariant Derived loop invariant: ((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && ((_local__threadpooling_working_0 + 1 <= _global_next && ((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_1 + 1 <= _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) || ((((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && (((_local__threadpooling_end_1 == _local__threadpooling_i_0 && _local__threadpooling_end_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || (_local__threadpooling_end_1 + 1 <= _local__threadpooling_working_0 && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1))) && _local__threadpooling_working_1 + 2 <= _global_next) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _global_next) || (_local__threadpooling_end_0 <= _local__threadpooling_i_0 && (!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next)) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) || ((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _global_next == _local__threadpooling_end_0 && (((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 1 <= _global_next) && (_local__threadpooling_end_1 + 1 <= _local__threadpooling_working_0 || _local__threadpooling_end_1 == _local__threadpooling_working_0) && _local__threadpooling_working_1 + 2 <= _global_next) || (((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1)))) || (((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && ((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 1 <= _global_next) && _global_next == _local__threadpooling_end_1 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_working_1 + 2 <= _global_next) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && (((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) || (((_local__threadpooling_working_0 + 1 <= _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && ((_local__threadpooling_end_1 == _local__threadpooling_i_0 && _local__threadpooling_end_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_end_0 == _global_next)) || (((((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_working_0) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_working_1 + 2 <= _global_next) - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: (((((_local__threadpooling_end_1 == _local__threadpooling_i_0 && ((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_end_0 == _global_next) || (((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && (!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 + 1 <= _global_next)) || (((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && _global_next == _local__threadpooling_end_0 && (((_local__threadpooling_working_0 + 1 <= _global_next && (_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || ((_local__threadpooling_working_0 + 1 <= _global_next && ((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_working_0) || ((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_end_1 == _local__threadpooling_working_0))) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1))) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_working_1 + 2 <= _global_next)) || (((_local__threadpooling_working_0 + 1 <= _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && ((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_working_0) || (((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 == _global_next))) && _local__threadpooling_working_1 + 2 <= _global_next)) || ((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && (((_local__threadpooling_end_0 + 1 <= _local__threadpooling_i_1 && (((((((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) || (((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1))) && _local__threadpooling_end_0 + 1 <= _global_next) || (((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1 && (!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || (((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1)) && _local__threadpooling_i_1 == _local__threadpooling_end_0) && _local__threadpooling_end_0 + 1 <= _global_next))) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: ((((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && ((_local__threadpooling_end_0 + 1 <= _local__threadpooling_i_1 && ((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) && _local__threadpooling_end_0 + 1 <= _global_next) || ((((((_local__threadpooling_end_0 == _local__threadpooling_working_1 && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_1 == _local__threadpooling_end_0) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_0 + 1 <= _global_next)) || (((((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && !(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0) || ((_local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next)) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0)) || ((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && ((((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) && _local__threadpooling_end_0 + 1 <= _global_next) || ((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && (_global_next == _local__threadpooling_end_0 && (((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) && _local__threadpooling_end_1 == _local__threadpooling_working_0) || ((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_working_0))) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_end_0)) || (((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && ((((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_working_0) || ((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_end_1 == _local__threadpooling_working_0)) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || (((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && (_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1))) && _local__threadpooling_working_1 + 2 <= _global_next) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (((((((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || ((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1)) && _local__threadpooling_end_0 + 1 <= _global_next) || (((((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || ((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1)) && _local__threadpooling_working_0 + 2 <= _global_next)) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) || (((((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 1 <= _global_next) && (_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || ((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && ((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 == _local__threadpooling_working_0) || (((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_working_0))) && _local__threadpooling_working_0 + 1 <= _global_next)) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_1 + 2 <= _global_next) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || ((_local__threadpooling_working_1 + 1 <= _global_next && _local__threadpooling_end_1 == _global_next && !(_local__threadpooling_working_1 == _local__threadpooling_working_0)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1)) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || (((_local__threadpooling_working_0 + 1 <= _global_next && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && (((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && _local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0) && !(_local__threadpooling_working_1 == _local__threadpooling_working_0)) || _local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0)) && _local__threadpooling_end_0 == _global_next)) && _local__threadpooling_end_0 + 1 <= _global_next) || (_global_next == _local__threadpooling_end_0 && (((((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || ((_local__threadpooling_working_1 + 1 <= _global_next && _local__threadpooling_end_1 == _global_next && !(_local__threadpooling_working_1 == _local__threadpooling_working_0)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1)) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || (((_local__threadpooling_working_0 + 1 <= _global_next && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && (((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && _local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0) && !(_local__threadpooling_working_1 == _local__threadpooling_working_0)) || _local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0)) && _local__threadpooling_end_0 == _global_next)))) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) || ((((_local__threadpooling_working_0 + 2 <= _global_next && ((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || ((_local__threadpooling_working_1 + 1 <= _global_next && _local__threadpooling_end_1 == _global_next && !(_local__threadpooling_working_1 == _local__threadpooling_working_0)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1))) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 6 error locations. SAFE Result, 67.2s OverallTime, 30 OverallIterations, 2 TraceHistogramMax, 14.2s AutomataDifference, 0.0s DeadEndRemovalTime, 48.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1393 SDtfs, 3055 SDslu, 1633 SDs, 0 SdLazy, 13797 SolverSat, 1756 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 371 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 340 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=267occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 30 MinimizatonAttempts, 2901 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 189 NumberOfFragments, 2501 HoareAnnotationTreeSize, 16 FomulaSimplifications, 7180967160426309022 FormulaSimplificationTreeSizeReduction, 26.5s HoareSimplificationTime, 16 FomulaSimplificationsInter, 122173963469419134 FormulaSimplificationTreeSizeReductionInter, 21.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 207 ConstructedInterpolants, 0 QuantifiedInterpolants, 6779 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 11 PerfectInterpolantSequences, 16/66 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out2.mover.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-16-39-987.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out2.mover.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_13-16-39-987.csv Received shutdown request...