java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-56c9370 [2018-07-23 15:14:59,187 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 15:14:59,191 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 15:14:59,209 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 15:14:59,210 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 15:14:59,212 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 15:14:59,213 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 15:14:59,216 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 15:14:59,218 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 15:14:59,219 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 15:14:59,222 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 15:14:59,223 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 15:14:59,224 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 15:14:59,225 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 15:14:59,228 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 15:14:59,229 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 15:14:59,230 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 15:14:59,238 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 15:14:59,241 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 15:14:59,246 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 15:14:59,247 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 15:14:59,250 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 15:14:59,252 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 15:14:59,252 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 15:14:59,255 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 15:14:59,256 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 15:14:59,257 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 15:14:59,258 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 15:14:59,259 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 15:14:59,264 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 15:14:59,264 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 15:14:59,265 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 15:14:59,265 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 15:14:59,265 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 15:14:59,266 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 15:14:59,269 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 15:14:59,269 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 15:14:59,295 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 15:14:59,295 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 15:14:59,296 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 15:14:59,297 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 15:14:59,297 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 15:14:59,299 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 15:14:59,300 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 15:14:59,300 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 15:14:59,368 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 15:14:59,383 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 15:14:59,390 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 15:14:59,392 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 15:14:59,393 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 15:14:59,394 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-23 15:14:59,394 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl' [2018-07-23 15:14:59,457 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 15:14:59,459 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 15:14:59,459 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 15:14:59,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 15:14:59,460 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 15:14:59,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:14:59" (1/1) ... [2018-07-23 15:14:59,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:14:59" (1/1) ... [2018-07-23 15:14:59,500 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:14:59" (1/1) ... [2018-07-23 15:14:59,501 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:14:59" (1/1) ... [2018-07-23 15:14:59,505 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:14:59" (1/1) ... [2018-07-23 15:14:59,508 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:14:59" (1/1) ... [2018-07-23 15:14:59,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:14:59" (1/1) ... [2018-07-23 15:14:59,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 15:14:59,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 15:14:59,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 15:14:59,513 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 15:14:59,515 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:14:59" (1/1) ... [2018-07-23 15:14:59,594 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-07-23 15:14:59,594 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-07-23 15:14:59,594 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-07-23 15:14:59,804 INFO L258 CfgBuilder]: Using library mode [2018-07-23 15:14:59,805 INFO L202 PluginConnector]: Adding new model threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:14:59 BoogieIcfgContainer [2018-07-23 15:14:59,806 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 15:14:59,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 15:14:59,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 15:14:59,811 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 15:14:59,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:14:59" (1/2) ... [2018-07-23 15:14:59,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2828808b and model type threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 03:14:59, skipping insertion in model container [2018-07-23 15:14:59,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:14:59" (2/2) ... [2018-07-23 15:14:59,815 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out2.mover.bpl [2018-07-23 15:14:59,833 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 15:14:59,842 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-07-23 15:14:59,905 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 15:14:59,906 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 15:14:59,907 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 15:14:59,907 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 15:14:59,907 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-23 15:14:59,907 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 15:14:59,907 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 15:14:59,908 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 15:14:59,908 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 15:14:59,928 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-07-23 15:14:59,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 15:14:59,940 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:14:59,942 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 15:14:59,942 INFO L414 AbstractCegarLoop]: === Iteration 1 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:14:59,950 INFO L82 PathProgramCache]: Analyzing trace with hash 934086, now seen corresponding path program 1 times [2018-07-23 15:14:59,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:14:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:00,104 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-23 15:15:00,108 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:15:00,109 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 15:15:00,114 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 15:15:00,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 15:15:00,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 15:15:00,135 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 5 states. [2018-07-23 15:15:00,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:00,400 INFO L93 Difference]: Finished difference Result 30 states and 67 transitions. [2018-07-23 15:15:00,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 15:15:00,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-07-23 15:15:00,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:00,425 INFO L225 Difference]: With dead ends: 30 [2018-07-23 15:15:00,426 INFO L226 Difference]: Without dead ends: 28 [2018-07-23 15:15:00,429 INFO L573 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-23 15:15:00,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-07-23 15:15:00,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2018-07-23 15:15:00,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-07-23 15:15:00,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 48 transitions. [2018-07-23 15:15:00,473 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 48 transitions. Word has length 4 [2018-07-23 15:15:00,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:00,473 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 48 transitions. [2018-07-23 15:15:00,473 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 15:15:00,474 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 48 transitions. [2018-07-23 15:15:00,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 15:15:00,474 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:00,475 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 15:15:00,475 INFO L414 AbstractCegarLoop]: === Iteration 2 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:00,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1042842, now seen corresponding path program 1 times [2018-07-23 15:15:00,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:00,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:00,529 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-23 15:15:00,530 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:15:00,530 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 15:15:00,533 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 15:15:00,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 15:15:00,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 15:15:00,534 INFO L87 Difference]: Start difference. First operand 22 states and 48 transitions. Second operand 5 states. [2018-07-23 15:15:00,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:00,773 INFO L93 Difference]: Finished difference Result 50 states and 117 transitions. [2018-07-23 15:15:00,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 15:15:00,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-07-23 15:15:00,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:00,775 INFO L225 Difference]: With dead ends: 50 [2018-07-23 15:15:00,776 INFO L226 Difference]: Without dead ends: 46 [2018-07-23 15:15:00,777 INFO L573 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-23 15:15:00,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-07-23 15:15:00,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2018-07-23 15:15:00,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-07-23 15:15:00,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 101 transitions. [2018-07-23 15:15:00,795 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 101 transitions. Word has length 4 [2018-07-23 15:15:00,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:00,795 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 101 transitions. [2018-07-23 15:15:00,795 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 15:15:00,795 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 101 transitions. [2018-07-23 15:15:00,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 15:15:00,796 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:00,796 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 15:15:00,797 INFO L414 AbstractCegarLoop]: === Iteration 3 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:00,797 INFO L82 PathProgramCache]: Analyzing trace with hash 897580813, now seen corresponding path program 1 times [2018-07-23 15:15:00,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:00,825 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-23 15:15:00,825 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:15:00,825 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 15:15:00,829 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 15:15:00,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 15:15:00,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 15:15:00,830 INFO L87 Difference]: Start difference. First operand 40 states and 101 transitions. Second operand 6 states. [2018-07-23 15:15:01,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:01,137 INFO L93 Difference]: Finished difference Result 133 states and 334 transitions. [2018-07-23 15:15:01,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 15:15:01,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-23 15:15:01,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:01,141 INFO L225 Difference]: With dead ends: 133 [2018-07-23 15:15:01,141 INFO L226 Difference]: Without dead ends: 129 [2018-07-23 15:15:01,142 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:15:01,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-07-23 15:15:01,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 79. [2018-07-23 15:15:01,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-23 15:15:01,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 233 transitions. [2018-07-23 15:15:01,177 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 233 transitions. Word has length 6 [2018-07-23 15:15:01,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:01,178 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 233 transitions. [2018-07-23 15:15:01,179 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 15:15:01,179 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 233 transitions. [2018-07-23 15:15:01,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 15:15:01,182 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:01,182 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 15:15:01,185 INFO L414 AbstractCegarLoop]: === Iteration 4 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:01,185 INFO L82 PathProgramCache]: Analyzing trace with hash 897578023, now seen corresponding path program 1 times [2018-07-23 15:15:01,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:01,209 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-23 15:15:01,209 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:15:01,210 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 15:15:01,211 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 15:15:01,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 15:15:01,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 15:15:01,212 INFO L87 Difference]: Start difference. First operand 79 states and 233 transitions. Second operand 6 states. [2018-07-23 15:15:01,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:01,476 INFO L93 Difference]: Finished difference Result 159 states and 405 transitions. [2018-07-23 15:15:01,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 15:15:01,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-23 15:15:01,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:01,482 INFO L225 Difference]: With dead ends: 159 [2018-07-23 15:15:01,488 INFO L226 Difference]: Without dead ends: 155 [2018-07-23 15:15:01,490 INFO L573 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-23 15:15:01,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-23 15:15:01,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 87. [2018-07-23 15:15:01,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-23 15:15:01,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 262 transitions. [2018-07-23 15:15:01,542 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 262 transitions. Word has length 6 [2018-07-23 15:15:01,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:01,543 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 262 transitions. [2018-07-23 15:15:01,543 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 15:15:01,543 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 262 transitions. [2018-07-23 15:15:01,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 15:15:01,544 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:01,545 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 15:15:01,545 INFO L414 AbstractCegarLoop]: === Iteration 5 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:01,545 INFO L82 PathProgramCache]: Analyzing trace with hash 897664513, now seen corresponding path program 1 times [2018-07-23 15:15:01,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:01,569 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-23 15:15:01,570 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:15:01,570 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 15:15:01,571 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 15:15:01,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 15:15:01,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 15:15:01,574 INFO L87 Difference]: Start difference. First operand 87 states and 262 transitions. Second operand 6 states. [2018-07-23 15:15:01,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:01,788 INFO L93 Difference]: Finished difference Result 171 states and 457 transitions. [2018-07-23 15:15:01,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 15:15:01,788 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-23 15:15:01,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:01,790 INFO L225 Difference]: With dead ends: 171 [2018-07-23 15:15:01,791 INFO L226 Difference]: Without dead ends: 167 [2018-07-23 15:15:01,792 INFO L573 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-23 15:15:01,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-23 15:15:01,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 96. [2018-07-23 15:15:01,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-07-23 15:15:01,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 287 transitions. [2018-07-23 15:15:01,826 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 287 transitions. Word has length 6 [2018-07-23 15:15:01,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:01,826 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 287 transitions. [2018-07-23 15:15:01,827 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 15:15:01,827 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 287 transitions. [2018-07-23 15:15:01,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 15:15:01,828 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:01,828 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 15:15:01,828 INFO L414 AbstractCegarLoop]: === Iteration 6 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:01,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1000032062, now seen corresponding path program 1 times [2018-07-23 15:15:01,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:01,848 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-23 15:15:01,849 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:15:01,849 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 15:15:01,850 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 15:15:01,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 15:15:01,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 15:15:01,851 INFO L87 Difference]: Start difference. First operand 96 states and 287 transitions. Second operand 6 states. [2018-07-23 15:15:02,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:02,086 INFO L93 Difference]: Finished difference Result 221 states and 600 transitions. [2018-07-23 15:15:02,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 15:15:02,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-23 15:15:02,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:02,090 INFO L225 Difference]: With dead ends: 221 [2018-07-23 15:15:02,090 INFO L226 Difference]: Without dead ends: 217 [2018-07-23 15:15:02,091 INFO L573 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-23 15:15:02,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-07-23 15:15:02,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 127. [2018-07-23 15:15:02,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-07-23 15:15:02,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 395 transitions. [2018-07-23 15:15:02,147 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 395 transitions. Word has length 6 [2018-07-23 15:15:02,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:02,147 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 395 transitions. [2018-07-23 15:15:02,148 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 15:15:02,148 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 395 transitions. [2018-07-23 15:15:02,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 15:15:02,151 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:02,151 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 15:15:02,152 INFO L414 AbstractCegarLoop]: === Iteration 7 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:02,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1000029272, now seen corresponding path program 1 times [2018-07-23 15:15:02,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:02,178 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-23 15:15:02,178 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:15:02,178 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 15:15:02,179 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 15:15:02,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 15:15:02,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 15:15:02,181 INFO L87 Difference]: Start difference. First operand 127 states and 395 transitions. Second operand 6 states. [2018-07-23 15:15:02,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:02,419 INFO L93 Difference]: Finished difference Result 225 states and 625 transitions. [2018-07-23 15:15:02,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 15:15:02,419 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-23 15:15:02,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:02,424 INFO L225 Difference]: With dead ends: 225 [2018-07-23 15:15:02,425 INFO L226 Difference]: Without dead ends: 221 [2018-07-23 15:15:02,425 INFO L573 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-23 15:15:02,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-07-23 15:15:02,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 133. [2018-07-23 15:15:02,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-07-23 15:15:02,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 416 transitions. [2018-07-23 15:15:02,478 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 416 transitions. Word has length 6 [2018-07-23 15:15:02,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:02,478 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 416 transitions. [2018-07-23 15:15:02,478 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 15:15:02,479 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 416 transitions. [2018-07-23 15:15:02,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 15:15:02,481 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:02,482 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-23 15:15:02,482 INFO L414 AbstractCegarLoop]: === Iteration 8 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:02,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1002176124, now seen corresponding path program 1 times [2018-07-23 15:15:02,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:02,503 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-23 15:15:02,504 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:02,504 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 15:15:02,504 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 15:15:02,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 15:15:02,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-07-23 15:15:02,505 INFO L87 Difference]: Start difference. First operand 133 states and 416 transitions. Second operand 6 states. [2018-07-23 15:15:02,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:02,649 INFO L93 Difference]: Finished difference Result 156 states and 481 transitions. [2018-07-23 15:15:02,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 15:15:02,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-23 15:15:02,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:02,651 INFO L225 Difference]: With dead ends: 156 [2018-07-23 15:15:02,652 INFO L226 Difference]: Without dead ends: 154 [2018-07-23 15:15:02,653 INFO L573 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-23 15:15:02,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-07-23 15:15:02,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 128. [2018-07-23 15:15:02,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-07-23 15:15:02,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 398 transitions. [2018-07-23 15:15:02,696 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 398 transitions. Word has length 6 [2018-07-23 15:15:02,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:02,696 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 398 transitions. [2018-07-23 15:15:02,697 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 15:15:02,697 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 398 transitions. [2018-07-23 15:15:02,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 15:15:02,698 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:02,698 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 15:15:02,698 INFO L414 AbstractCegarLoop]: === Iteration 9 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:02,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1002149145, now seen corresponding path program 1 times [2018-07-23 15:15:02,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:02,711 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-23 15:15:02,711 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:15:02,712 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 15:15:02,712 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 15:15:02,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 15:15:02,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 15:15:02,713 INFO L87 Difference]: Start difference. First operand 128 states and 398 transitions. Second operand 6 states. [2018-07-23 15:15:02,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:02,933 INFO L93 Difference]: Finished difference Result 236 states and 666 transitions. [2018-07-23 15:15:02,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 15:15:02,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-23 15:15:02,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:02,935 INFO L225 Difference]: With dead ends: 236 [2018-07-23 15:15:02,936 INFO L226 Difference]: Without dead ends: 232 [2018-07-23 15:15:02,936 INFO L573 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-23 15:15:02,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-07-23 15:15:02,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 150. [2018-07-23 15:15:02,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-07-23 15:15:02,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 463 transitions. [2018-07-23 15:15:02,995 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 463 transitions. Word has length 6 [2018-07-23 15:15:02,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:02,996 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 463 transitions. [2018-07-23 15:15:02,996 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 15:15:02,996 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 463 transitions. [2018-07-23 15:15:02,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 15:15:02,997 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:02,997 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:02,998 INFO L414 AbstractCegarLoop]: === Iteration 10 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:02,998 INFO L82 PathProgramCache]: Analyzing trace with hash -713257336, now seen corresponding path program 1 times [2018-07-23 15:15:02,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:03,013 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-23 15:15:03,014 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:03,014 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 15:15:03,015 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:15:03,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:15:03,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:15:03,016 INFO L87 Difference]: Start difference. First operand 150 states and 463 transitions. Second operand 7 states. [2018-07-23 15:15:03,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:03,359 INFO L93 Difference]: Finished difference Result 271 states and 762 transitions. [2018-07-23 15:15:03,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 15:15:03,359 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-23 15:15:03,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:03,362 INFO L225 Difference]: With dead ends: 271 [2018-07-23 15:15:03,362 INFO L226 Difference]: Without dead ends: 267 [2018-07-23 15:15:03,364 INFO L573 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-23 15:15:03,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-07-23 15:15:03,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 177. [2018-07-23 15:15:03,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-07-23 15:15:03,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 550 transitions. [2018-07-23 15:15:03,441 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 550 transitions. Word has length 8 [2018-07-23 15:15:03,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:03,441 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 550 transitions. [2018-07-23 15:15:03,441 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:15:03,441 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 550 transitions. [2018-07-23 15:15:03,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 15:15:03,443 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:03,443 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:03,443 INFO L414 AbstractCegarLoop]: === Iteration 11 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:03,446 INFO L82 PathProgramCache]: Analyzing trace with hash -714144432, now seen corresponding path program 1 times [2018-07-23 15:15:03,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:03,466 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-23 15:15:03,466 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:03,466 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 15:15:03,467 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:15:03,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:15:03,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:15:03,468 INFO L87 Difference]: Start difference. First operand 177 states and 550 transitions. Second operand 7 states. [2018-07-23 15:15:03,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:03,828 INFO L93 Difference]: Finished difference Result 291 states and 819 transitions. [2018-07-23 15:15:03,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 15:15:03,828 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-23 15:15:03,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:03,831 INFO L225 Difference]: With dead ends: 291 [2018-07-23 15:15:03,831 INFO L226 Difference]: Without dead ends: 287 [2018-07-23 15:15:03,832 INFO L573 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-23 15:15:03,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-07-23 15:15:03,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 185. [2018-07-23 15:15:03,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-23 15:15:03,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 577 transitions. [2018-07-23 15:15:03,916 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 577 transitions. Word has length 8 [2018-07-23 15:15:03,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:03,917 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 577 transitions. [2018-07-23 15:15:03,917 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:15:03,917 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 577 transitions. [2018-07-23 15:15:03,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 15:15:03,918 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:03,918 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:03,921 INFO L414 AbstractCegarLoop]: === Iteration 12 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:03,921 INFO L82 PathProgramCache]: Analyzing trace with hash -714147222, now seen corresponding path program 1 times [2018-07-23 15:15:03,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:03,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:03,947 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-23 15:15:03,948 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:03,948 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 15:15:03,949 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:15:03,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:15:03,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:15:03,949 INFO L87 Difference]: Start difference. First operand 185 states and 577 transitions. Second operand 7 states. [2018-07-23 15:15:04,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:04,389 INFO L93 Difference]: Finished difference Result 306 states and 862 transitions. [2018-07-23 15:15:04,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 15:15:04,390 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-23 15:15:04,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:04,393 INFO L225 Difference]: With dead ends: 306 [2018-07-23 15:15:04,393 INFO L226 Difference]: Without dead ends: 302 [2018-07-23 15:15:04,394 INFO L573 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-23 15:15:04,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-07-23 15:15:04,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 184. [2018-07-23 15:15:04,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-07-23 15:15:04,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 575 transitions. [2018-07-23 15:15:04,478 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 575 transitions. Word has length 8 [2018-07-23 15:15:04,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:04,478 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 575 transitions. [2018-07-23 15:15:04,478 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:15:04,479 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 575 transitions. [2018-07-23 15:15:04,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 15:15:04,479 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:04,479 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:04,480 INFO L414 AbstractCegarLoop]: === Iteration 13 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:04,480 INFO L82 PathProgramCache]: Analyzing trace with hash -735593952, now seen corresponding path program 1 times [2018-07-23 15:15:04,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:04,514 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-23 15:15:04,514 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:04,515 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:15:04,515 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 15:15:04,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 15:15:04,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:15:04,516 INFO L87 Difference]: Start difference. First operand 184 states and 575 transitions. Second operand 8 states. [2018-07-23 15:15:04,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:04,905 INFO L93 Difference]: Finished difference Result 273 states and 771 transitions. [2018-07-23 15:15:04,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 15:15:04,905 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 15:15:04,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:04,907 INFO L225 Difference]: With dead ends: 273 [2018-07-23 15:15:04,908 INFO L226 Difference]: Without dead ends: 269 [2018-07-23 15:15:04,908 INFO L573 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-23 15:15:04,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-07-23 15:15:04,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 180. [2018-07-23 15:15:04,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-07-23 15:15:04,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 560 transitions. [2018-07-23 15:15:04,998 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 560 transitions. Word has length 8 [2018-07-23 15:15:04,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:04,999 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 560 transitions. [2018-07-23 15:15:04,999 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 15:15:04,999 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 560 transitions. [2018-07-23 15:15:04,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 15:15:05,000 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:05,000 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:05,000 INFO L414 AbstractCegarLoop]: === Iteration 14 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:05,000 INFO L82 PathProgramCache]: Analyzing trace with hash -735596742, now seen corresponding path program 1 times [2018-07-23 15:15:05,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:05,019 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-23 15:15:05,019 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:05,019 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:15:05,020 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 15:15:05,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 15:15:05,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:15:05,021 INFO L87 Difference]: Start difference. First operand 180 states and 560 transitions. Second operand 8 states. [2018-07-23 15:15:05,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:05,426 INFO L93 Difference]: Finished difference Result 310 states and 878 transitions. [2018-07-23 15:15:05,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 15:15:05,427 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 15:15:05,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:05,432 INFO L225 Difference]: With dead ends: 310 [2018-07-23 15:15:05,433 INFO L226 Difference]: Without dead ends: 306 [2018-07-23 15:15:05,433 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:15:05,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-07-23 15:15:05,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 193. [2018-07-23 15:15:05,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-07-23 15:15:05,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 606 transitions. [2018-07-23 15:15:05,528 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 606 transitions. Word has length 8 [2018-07-23 15:15:05,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:05,528 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 606 transitions. [2018-07-23 15:15:05,528 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 15:15:05,528 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 606 transitions. [2018-07-23 15:15:05,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 15:15:05,529 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:05,529 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:05,529 INFO L414 AbstractCegarLoop]: === Iteration 15 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:05,530 INFO L82 PathProgramCache]: Analyzing trace with hash -735510252, now seen corresponding path program 1 times [2018-07-23 15:15:05,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:05,555 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-23 15:15:05,555 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:05,555 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:15:05,556 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 15:15:05,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 15:15:05,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:15:05,557 INFO L87 Difference]: Start difference. First operand 193 states and 606 transitions. Second operand 8 states. [2018-07-23 15:15:06,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:06,047 INFO L93 Difference]: Finished difference Result 348 states and 984 transitions. [2018-07-23 15:15:06,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 15:15:06,047 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 15:15:06,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:06,050 INFO L225 Difference]: With dead ends: 348 [2018-07-23 15:15:06,051 INFO L226 Difference]: Without dead ends: 344 [2018-07-23 15:15:06,052 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2018-07-23 15:15:06,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-07-23 15:15:06,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 225. [2018-07-23 15:15:06,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-07-23 15:15:06,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 702 transitions. [2018-07-23 15:15:06,180 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 702 transitions. Word has length 8 [2018-07-23 15:15:06,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:06,180 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 702 transitions. [2018-07-23 15:15:06,180 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 15:15:06,180 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 702 transitions. [2018-07-23 15:15:06,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 15:15:06,181 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:06,181 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:06,182 INFO L414 AbstractCegarLoop]: === Iteration 16 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:06,182 INFO L82 PathProgramCache]: Analyzing trace with hash -633327122, now seen corresponding path program 1 times [2018-07-23 15:15:06,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:06,198 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-23 15:15:06,199 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:06,199 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 15:15:06,199 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:15:06,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:15:06,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:15:06,200 INFO L87 Difference]: Start difference. First operand 225 states and 702 transitions. Second operand 7 states. [2018-07-23 15:15:06,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:06,607 INFO L93 Difference]: Finished difference Result 389 states and 1133 transitions. [2018-07-23 15:15:06,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 15:15:06,608 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-23 15:15:06,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:06,611 INFO L225 Difference]: With dead ends: 389 [2018-07-23 15:15:06,611 INFO L226 Difference]: Without dead ends: 385 [2018-07-23 15:15:06,612 INFO L573 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-23 15:15:06,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-07-23 15:15:06,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 267. [2018-07-23 15:15:06,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-07-23 15:15:06,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 829 transitions. [2018-07-23 15:15:06,806 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 829 transitions. Word has length 8 [2018-07-23 15:15:06,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:06,807 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 829 transitions. [2018-07-23 15:15:06,807 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:15:06,807 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 829 transitions. [2018-07-23 15:15:06,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 15:15:06,808 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:06,808 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:06,809 INFO L414 AbstractCegarLoop]: === Iteration 17 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:06,809 INFO L82 PathProgramCache]: Analyzing trace with hash -632821636, now seen corresponding path program 1 times [2018-07-23 15:15:06,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:06,823 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-23 15:15:06,823 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:06,824 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 15:15:06,824 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:15:06,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:15:06,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:15:06,825 INFO L87 Difference]: Start difference. First operand 267 states and 829 transitions. Second operand 7 states. [2018-07-23 15:15:07,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:07,278 INFO L93 Difference]: Finished difference Result 339 states and 995 transitions. [2018-07-23 15:15:07,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 15:15:07,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-23 15:15:07,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:07,281 INFO L225 Difference]: With dead ends: 339 [2018-07-23 15:15:07,282 INFO L226 Difference]: Without dead ends: 335 [2018-07-23 15:15:07,283 INFO L573 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-23 15:15:07,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-07-23 15:15:07,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 236. [2018-07-23 15:15:07,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-07-23 15:15:07,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 725 transitions. [2018-07-23 15:15:07,464 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 725 transitions. Word has length 8 [2018-07-23 15:15:07,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:07,464 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 725 transitions. [2018-07-23 15:15:07,464 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:15:07,465 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 725 transitions. [2018-07-23 15:15:07,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 15:15:07,465 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:07,465 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:07,466 INFO L414 AbstractCegarLoop]: === Iteration 18 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:07,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1041857831, now seen corresponding path program 1 times [2018-07-23 15:15:07,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:07,479 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-23 15:15:07,479 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:07,479 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 15:15:07,480 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:15:07,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:15:07,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:15:07,481 INFO L87 Difference]: Start difference. First operand 236 states and 725 transitions. Second operand 7 states. [2018-07-23 15:15:08,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:08,069 INFO L93 Difference]: Finished difference Result 466 states and 1349 transitions. [2018-07-23 15:15:08,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 15:15:08,069 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-23 15:15:08,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:08,073 INFO L225 Difference]: With dead ends: 466 [2018-07-23 15:15:08,074 INFO L226 Difference]: Without dead ends: 462 [2018-07-23 15:15:08,075 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:15:08,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-07-23 15:15:08,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 274. [2018-07-23 15:15:08,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-07-23 15:15:08,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 850 transitions. [2018-07-23 15:15:08,267 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 850 transitions. Word has length 8 [2018-07-23 15:15:08,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:08,267 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 850 transitions. [2018-07-23 15:15:08,267 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:15:08,267 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 850 transitions. [2018-07-23 15:15:08,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 15:15:08,268 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:08,268 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:08,268 INFO L414 AbstractCegarLoop]: === Iteration 19 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:08,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1041854855, now seen corresponding path program 1 times [2018-07-23 15:15:08,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:08,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:08,278 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:15:08,278 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-23 15:15:08,278 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 15:15:08,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 15:15:08,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:15:08,279 INFO L87 Difference]: Start difference. First operand 274 states and 850 transitions. Second operand 4 states. [2018-07-23 15:15:08,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:08,455 INFO L93 Difference]: Finished difference Result 465 states and 1432 transitions. [2018-07-23 15:15:08,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 15:15:08,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-07-23 15:15:08,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:08,457 INFO L225 Difference]: With dead ends: 465 [2018-07-23 15:15:08,457 INFO L226 Difference]: Without dead ends: 240 [2018-07-23 15:15:08,459 INFO L573 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-23 15:15:08,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-07-23 15:15:08,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 170. [2018-07-23 15:15:08,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-07-23 15:15:08,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 487 transitions. [2018-07-23 15:15:08,606 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 487 transitions. Word has length 8 [2018-07-23 15:15:08,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:08,606 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 487 transitions. [2018-07-23 15:15:08,607 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 15:15:08,607 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 487 transitions. [2018-07-23 15:15:08,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 15:15:08,607 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:08,607 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:08,608 INFO L414 AbstractCegarLoop]: === Iteration 20 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:08,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1043246476, now seen corresponding path program 1 times [2018-07-23 15:15:08,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:08,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:08,620 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-23 15:15:08,621 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:08,621 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 15:15:08,621 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:15:08,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:15:08,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:15:08,622 INFO L87 Difference]: Start difference. First operand 170 states and 487 transitions. Second operand 7 states. [2018-07-23 15:15:09,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:09,196 INFO L93 Difference]: Finished difference Result 379 states and 1034 transitions. [2018-07-23 15:15:09,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 15:15:09,197 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-23 15:15:09,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:09,200 INFO L225 Difference]: With dead ends: 379 [2018-07-23 15:15:09,200 INFO L226 Difference]: Without dead ends: 375 [2018-07-23 15:15:09,201 INFO L573 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-23 15:15:09,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-07-23 15:15:09,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 258. [2018-07-23 15:15:09,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-07-23 15:15:09,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 763 transitions. [2018-07-23 15:15:09,452 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 763 transitions. Word has length 8 [2018-07-23 15:15:09,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:09,453 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 763 transitions. [2018-07-23 15:15:09,453 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:15:09,453 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 763 transitions. [2018-07-23 15:15:09,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 15:15:09,453 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:09,454 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:09,454 INFO L414 AbstractCegarLoop]: === Iteration 21 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:09,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1047210601, now seen corresponding path program 1 times [2018-07-23 15:15:09,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:09,465 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-23 15:15:09,465 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:09,465 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 15:15:09,466 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:15:09,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:15:09,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:15:09,467 INFO L87 Difference]: Start difference. First operand 258 states and 763 transitions. Second operand 7 states. [2018-07-23 15:15:10,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:10,156 INFO L93 Difference]: Finished difference Result 448 states and 1217 transitions. [2018-07-23 15:15:10,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 15:15:10,156 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-23 15:15:10,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:10,159 INFO L225 Difference]: With dead ends: 448 [2018-07-23 15:15:10,160 INFO L226 Difference]: Without dead ends: 444 [2018-07-23 15:15:10,160 INFO L573 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-23 15:15:10,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-07-23 15:15:10,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 268. [2018-07-23 15:15:10,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-07-23 15:15:10,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 802 transitions. [2018-07-23 15:15:10,427 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 802 transitions. Word has length 8 [2018-07-23 15:15:10,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:10,428 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 802 transitions. [2018-07-23 15:15:10,428 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:15:10,428 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 802 transitions. [2018-07-23 15:15:10,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 15:15:10,429 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:10,429 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:10,429 INFO L414 AbstractCegarLoop]: === Iteration 22 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:10,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1047213391, now seen corresponding path program 1 times [2018-07-23 15:15:10,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:10,447 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-23 15:15:10,448 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:10,448 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 15:15:10,448 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:15:10,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:15:10,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:15:10,450 INFO L87 Difference]: Start difference. First operand 268 states and 802 transitions. Second operand 7 states. [2018-07-23 15:15:11,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:11,278 INFO L93 Difference]: Finished difference Result 448 states and 1220 transitions. [2018-07-23 15:15:11,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 15:15:11,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-23 15:15:11,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:11,284 INFO L225 Difference]: With dead ends: 448 [2018-07-23 15:15:11,284 INFO L226 Difference]: Without dead ends: 444 [2018-07-23 15:15:11,285 INFO L573 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-23 15:15:11,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-07-23 15:15:11,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 259. [2018-07-23 15:15:11,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-07-23 15:15:11,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 767 transitions. [2018-07-23 15:15:11,590 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 767 transitions. Word has length 8 [2018-07-23 15:15:11,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:11,591 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 767 transitions. [2018-07-23 15:15:11,591 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:15:11,591 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 767 transitions. [2018-07-23 15:15:11,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 15:15:11,591 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:11,592 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:11,592 INFO L414 AbstractCegarLoop]: === Iteration 23 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:11,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1119662313, now seen corresponding path program 1 times [2018-07-23 15:15:11,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:11,603 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-23 15:15:11,603 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:11,604 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 15:15:11,604 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:15:11,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:15:11,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:15:11,605 INFO L87 Difference]: Start difference. First operand 259 states and 767 transitions. Second operand 7 states. [2018-07-23 15:15:12,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:12,329 INFO L93 Difference]: Finished difference Result 421 states and 1143 transitions. [2018-07-23 15:15:12,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 15:15:12,330 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-23 15:15:12,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:12,333 INFO L225 Difference]: With dead ends: 421 [2018-07-23 15:15:12,333 INFO L226 Difference]: Without dead ends: 417 [2018-07-23 15:15:12,334 INFO L573 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-23 15:15:12,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-07-23 15:15:12,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 256. [2018-07-23 15:15:12,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-07-23 15:15:12,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 758 transitions. [2018-07-23 15:15:12,592 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 758 transitions. Word has length 8 [2018-07-23 15:15:12,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:12,593 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 758 transitions. [2018-07-23 15:15:12,593 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:15:12,593 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 758 transitions. [2018-07-23 15:15:12,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 15:15:12,594 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:12,594 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:12,594 INFO L414 AbstractCegarLoop]: === Iteration 24 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:12,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1119665103, now seen corresponding path program 1 times [2018-07-23 15:15:12,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:12,608 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-23 15:15:12,608 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:12,609 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 15:15:12,609 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:15:12,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:15:12,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:15:12,610 INFO L87 Difference]: Start difference. First operand 256 states and 758 transitions. Second operand 7 states. [2018-07-23 15:15:13,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:13,280 INFO L93 Difference]: Finished difference Result 403 states and 1093 transitions. [2018-07-23 15:15:13,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 15:15:13,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-23 15:15:13,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:13,283 INFO L225 Difference]: With dead ends: 403 [2018-07-23 15:15:13,283 INFO L226 Difference]: Without dead ends: 399 [2018-07-23 15:15:13,284 INFO L573 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-23 15:15:13,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-07-23 15:15:13,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 232. [2018-07-23 15:15:13,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-07-23 15:15:13,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 668 transitions. [2018-07-23 15:15:13,503 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 668 transitions. Word has length 8 [2018-07-23 15:15:13,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:13,503 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 668 transitions. [2018-07-23 15:15:13,504 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:15:13,504 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 668 transitions. [2018-07-23 15:15:13,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 15:15:13,504 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:13,504 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:13,505 INFO L414 AbstractCegarLoop]: === Iteration 25 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:13,505 INFO L82 PathProgramCache]: Analyzing trace with hash 992658932, now seen corresponding path program 1 times [2018-07-23 15:15:13,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:13,516 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-23 15:15:13,516 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:13,516 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 15:15:13,517 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:15:13,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:15:13,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:15:13,517 INFO L87 Difference]: Start difference. First operand 232 states and 668 transitions. Second operand 7 states. [2018-07-23 15:15:14,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:14,050 INFO L93 Difference]: Finished difference Result 348 states and 951 transitions. [2018-07-23 15:15:14,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 15:15:14,051 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-23 15:15:14,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:14,053 INFO L225 Difference]: With dead ends: 348 [2018-07-23 15:15:14,053 INFO L226 Difference]: Without dead ends: 344 [2018-07-23 15:15:14,054 INFO L573 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-23 15:15:14,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-07-23 15:15:14,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 152. [2018-07-23 15:15:14,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-07-23 15:15:14,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 428 transitions. [2018-07-23 15:15:14,263 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 428 transitions. Word has length 8 [2018-07-23 15:15:14,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:14,264 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 428 transitions. [2018-07-23 15:15:14,264 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:15:14,264 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 428 transitions. [2018-07-23 15:15:14,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 15:15:14,264 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:14,265 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:14,265 INFO L414 AbstractCegarLoop]: === Iteration 26 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:14,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1843754049, now seen corresponding path program 1 times [2018-07-23 15:15:14,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:14,273 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-23 15:15:14,274 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:15:14,274 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-23 15:15:14,274 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 15:15:14,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 15:15:14,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:15:14,275 INFO L87 Difference]: Start difference. First operand 152 states and 428 transitions. Second operand 4 states. [2018-07-23 15:15:14,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:14,534 INFO L93 Difference]: Finished difference Result 288 states and 788 transitions. [2018-07-23 15:15:14,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 15:15:14,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-07-23 15:15:14,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:14,535 INFO L225 Difference]: With dead ends: 288 [2018-07-23 15:15:14,535 INFO L226 Difference]: Without dead ends: 137 [2018-07-23 15:15:14,539 INFO L573 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-23 15:15:14,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-23 15:15:14,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 124. [2018-07-23 15:15:14,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-07-23 15:15:14,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 302 transitions. [2018-07-23 15:15:14,756 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 302 transitions. Word has length 10 [2018-07-23 15:15:14,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:14,756 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 302 transitions. [2018-07-23 15:15:14,756 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 15:15:14,758 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 302 transitions. [2018-07-23 15:15:14,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 15:15:14,758 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:14,759 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:14,759 INFO L414 AbstractCegarLoop]: === Iteration 27 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:14,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1832478577, now seen corresponding path program 1 times [2018-07-23 15:15:14,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:14,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:14,770 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:15:14,770 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-23 15:15:14,771 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 15:15:14,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 15:15:14,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:15:14,771 INFO L87 Difference]: Start difference. First operand 124 states and 302 transitions. Second operand 4 states. [2018-07-23 15:15:15,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:15,077 INFO L93 Difference]: Finished difference Result 260 states and 641 transitions. [2018-07-23 15:15:15,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 15:15:15,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-07-23 15:15:15,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:15,079 INFO L225 Difference]: With dead ends: 260 [2018-07-23 15:15:15,080 INFO L226 Difference]: Without dead ends: 137 [2018-07-23 15:15:15,080 INFO L573 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-23 15:15:15,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-23 15:15:15,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 65. [2018-07-23 15:15:15,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-23 15:15:15,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 145 transitions. [2018-07-23 15:15:15,269 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 145 transitions. Word has length 10 [2018-07-23 15:15:15,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:15,270 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 145 transitions. [2018-07-23 15:15:15,270 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 15:15:15,270 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 145 transitions. [2018-07-23 15:15:15,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 15:15:15,271 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:15,271 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:15,271 INFO L414 AbstractCegarLoop]: === Iteration 28 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:15,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1370726818, now seen corresponding path program 1 times [2018-07-23 15:15:15,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:15,320 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:15,321 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:15,321 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 15:15:15,323 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 15:15:15,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 15:15:15,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:15:15,324 INFO L87 Difference]: Start difference. First operand 65 states and 145 transitions. Second operand 11 states. [2018-07-23 15:15:16,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:16,319 INFO L93 Difference]: Finished difference Result 214 states and 474 transitions. [2018-07-23 15:15:16,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 15:15:16,319 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2018-07-23 15:15:16,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:16,321 INFO L225 Difference]: With dead ends: 214 [2018-07-23 15:15:16,321 INFO L226 Difference]: Without dead ends: 210 [2018-07-23 15:15:16,322 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=549, Unknown=0, NotChecked=0, Total=702 [2018-07-23 15:15:16,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-07-23 15:15:16,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 69. [2018-07-23 15:15:16,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-23 15:15:16,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 158 transitions. [2018-07-23 15:15:16,558 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 158 transitions. Word has length 13 [2018-07-23 15:15:16,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:16,558 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 158 transitions. [2018-07-23 15:15:16,559 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 15:15:16,559 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 158 transitions. [2018-07-23 15:15:16,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 15:15:16,559 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:16,559 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:16,560 INFO L414 AbstractCegarLoop]: === Iteration 29 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:16,560 INFO L82 PathProgramCache]: Analyzing trace with hash -247522178, now seen corresponding path program 1 times [2018-07-23 15:15:16,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:16,595 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-23 15:15:16,595 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:16,595 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 15:15:16,595 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 15:15:16,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 15:15:16,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:15:16,596 INFO L87 Difference]: Start difference. First operand 69 states and 158 transitions. Second operand 11 states. [2018-07-23 15:15:17,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:17,742 INFO L93 Difference]: Finished difference Result 177 states and 397 transitions. [2018-07-23 15:15:17,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-23 15:15:17,742 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2018-07-23 15:15:17,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:17,743 INFO L225 Difference]: With dead ends: 177 [2018-07-23 15:15:17,743 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 15:15:17,744 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=212, Invalid=780, Unknown=0, NotChecked=0, Total=992 [2018-07-23 15:15:17,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 15:15:17,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 15:15:17,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 15:15:17,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 15:15:17,744 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-07-23 15:15:17,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:17,745 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 15:15:17,745 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 15:15:17,745 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 15:15:17,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 15:15:17,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 15:15:17,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:17,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:18,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:18,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:19,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:19,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:19,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:20,095 WARN L169 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 608 DAG size of output: 427 [2018-07-23 15:15:20,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:20,205 WARN L169 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 117 [2018-07-23 15:15:20,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:20,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:20,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:20,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:20,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:20,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:20,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:20,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:20,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:21,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:21,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:21,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:21,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:21,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:21,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:21,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:21,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:21,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:21,388 WARN L169 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 587 DAG size of output: 419 [2018-07-23 15:15:21,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:21,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:21,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:21,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:21,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:21,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:21,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:21,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:21,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:21,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:21,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:21,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:22,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:22,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:22,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:22,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:22,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:22,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:22,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:22,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:22,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:22,972 WARN L169 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 710 DAG size of output: 494 [2018-07-23 15:15:23,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:23,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:23,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:23,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:23,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:23,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:23,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:23,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:23,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:23,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:23,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:23,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:23,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:23,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:24,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:24,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:25,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:25,862 WARN L169 SmtUtils]: Spent 2.89 s on a formula simplification. DAG size of input: 953 DAG size of output: 654 [2018-07-23 15:15:26,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:26,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:27,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:27,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:28,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:28,782 WARN L169 SmtUtils]: Spent 2.92 s on a formula simplification. DAG size of input: 656 DAG size of output: 481 [2018-07-23 15:15:28,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:28,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:28,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:28,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:28,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:28,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:28,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:28,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:29,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:29,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:29,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:29,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:29,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:29,489 WARN L169 SmtUtils]: Spent 705.00 ms on a formula simplification. DAG size of input: 501 DAG size of output: 348 [2018-07-23 15:15:29,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:29,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:29,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:29,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:29,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:29,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:30,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:30,728 WARN L169 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 677 DAG size of output: 438 [2018-07-23 15:15:30,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:31,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:32,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:32,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:33,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:15:34,086 WARN L169 SmtUtils]: Spent 3.36 s on a formula simplification. DAG size of input: 660 DAG size of output: 425 [2018-07-23 15:15:36,003 WARN L169 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 388 DAG size of output: 45 [2018-07-23 15:15:36,225 WARN L169 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 39 [2018-07-23 15:15:38,097 WARN L169 SmtUtils]: Spent 1.87 s on a formula simplification. DAG size of input: 382 DAG size of output: 86 [2018-07-23 15:15:40,309 WARN L169 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 447 DAG size of output: 81 [2018-07-23 15:15:44,543 WARN L169 SmtUtils]: Spent 4.23 s on a formula simplification. DAG size of input: 622 DAG size of output: 90 [2018-07-23 15:15:47,076 WARN L169 SmtUtils]: Spent 2.53 s on a formula simplification. DAG size of input: 465 DAG size of output: 52 [2018-07-23 15:15:47,891 WARN L169 SmtUtils]: Spent 810.00 ms on a formula simplification. DAG size of input: 321 DAG size of output: 48 [2018-07-23 15:15:49,206 WARN L169 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 413 DAG size of output: 51 [2018-07-23 15:15:51,177 WARN L169 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 421 DAG size of output: 45 [2018-07-23 15:15:51,182 INFO L417 ceAbstractionStarter]: At program point L224(lines 84 224) the Hoare annotation is: (let ((.cse22 (+ product__local__threadpooling_i_0 1)) (.cse21 (+ product__local__threadpooling_end_1 1)) (.cse23 (+ product__local__threadpooling_working_0 1)) (.cse11 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse12 (= product__local__threadpooling_end_1 product__global_next)) (.cse13 (+ product__local__threadpooling_working_1 1)) (.cse8 (+ product__local__threadpooling_end_0 1)) (.cse2 (+ product__local__threadpooling_working_0 2)) (.cse19 (+ product__local__threadpooling_working_1 2))) (let ((.cse1 (<= .cse19 product__local__threadpooling_i_0)) (.cse3 (<= .cse2 product__global_next)) (.cse10 (<= .cse8 product__global_next)) (.cse9 (and .cse11 .cse12 (<= .cse13 product__global_next))) (.cse15 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse5 (= product__global_next product__local__threadpooling_end_0)) (.cse7 (<= .cse23 product__global_next)) (.cse18 (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)) (.cse17 (<= .cse21 product__local__threadpooling_working_0)) (.cse4 (<= product__local__threadpooling_end_0 .cse22)) (.cse14 (<= .cse23 product__local__threadpooling_i_1)) (.cse0 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1))) (.cse6 (<= .cse22 product__local__threadpooling_end_0))) (or (and (and .cse0 (and (and (and .cse1 (<= .cse2 product__local__threadpooling_i_1) .cse3) .cse4) .cse5) .cse6) (= product__local__threadpooling_i_0 product__local__threadpooling_end_1)) (and .cse0 .cse6 (or (and .cse7 (or (and (<= .cse8 product__local__threadpooling_i_1) (and .cse9 .cse4 (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) .cse10)) (and .cse4 (and .cse11 .cse12 (<= .cse13 product__local__threadpooling_i_0)) .cse10)) .cse14) (and (and (and .cse1 .cse12 .cse3) .cse4) .cse10))) (and .cse0 (and .cse7 .cse10 (and .cse15 .cse9) .cse14)) (and .cse7 .cse0 (let ((.cse16 (= product__local__threadpooling_end_0 product__global_next))) (or (and .cse15 .cse11 .cse16 .cse17) (and .cse15 .cse11 .cse18 .cse16))) (<= .cse19 product__global_next)) (and (and (and .cse5 .cse7 (or (and (let ((.cse20 (<= .cse21 product__local__threadpooling_i_0))) (or (and .cse20 (or (and .cse11 .cse18) (and .cse11 .cse17))) (and .cse20 .cse11 .cse14))) .cse4) (and .cse11 (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) .cse4 .cse14))) .cse0 .cse6) (<= .cse19 product__local__threadpooling_end_0))))) [2018-07-23 15:15:51,183 INFO L417 ceAbstractionStarter]: At program point productErr1AssertViolationASSERT(line 82) the Hoare annotation is: false [2018-07-23 15:15:51,184 INFO L417 ceAbstractionStarter]: At program point L192(lines 72 210) the Hoare annotation is: (let ((.cse22 (+ product__local__threadpooling_end_1 1)) (.cse5 (+ product__local__threadpooling_working_1 2)) (.cse24 (+ product__local__threadpooling_working_0 1)) (.cse11 (+ product__local__threadpooling_end_0 1)) (.cse15 (+ product__local__threadpooling_working_1 1))) (let ((.cse10 (<= .cse15 product__global_next)) (.cse9 (= product__local__threadpooling_end_1 product__global_next)) (.cse13 (<= .cse11 product__global_next)) (.cse14 (<= .cse24 product__local__threadpooling_i_1)) (.cse17 (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)) (.cse3 (<= .cse5 product__global_next)) (.cse2 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse12 (<= .cse24 product__global_next)) (.cse0 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1))) (.cse19 (= product__local__threadpooling_end_0 product__global_next)) (.cse18 (<= .cse22 product__local__threadpooling_working_0)) (.cse20 (<= .cse5 product__local__threadpooling_end_0))) (or (let ((.cse16 (<= .cse22 product__local__threadpooling_i_0)) (.cse21 (+ product__local__threadpooling_i_0 1))) (let ((.cse1 (= product__global_next product__local__threadpooling_end_0)) (.cse4 (<= product__local__threadpooling_end_0 .cse21)) (.cse6 (and .cse2 .cse16)) (.cse8 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))) (.cse7 (<= .cse21 product__local__threadpooling_end_0))) (or (or (and .cse0 (and .cse1 (or (and (and (and .cse2 (= product__local__threadpooling_end_1 product__local__threadpooling_i_0)) .cse3) .cse4) (and (and (<= .cse5 product__local__threadpooling_i_0) .cse6) .cse4)) (<= (+ product__local__threadpooling_working_0 2) product__global_next)) .cse7) (and (and .cse8 (or (and .cse9 .cse10 (<= .cse11 product__local__threadpooling_i_1) .cse4 (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))) (and (= product__local__threadpooling_end_0 product__local__threadpooling_working_1) .cse9 .cse4)) .cse12 .cse13 .cse14) .cse0)) (and (= product__local__threadpooling_i_0 product__local__threadpooling_end_1) (and (and .cse1 (and (and .cse8 (<= .cse15 product__local__threadpooling_i_0) .cse14) .cse4) .cse12) .cse0 .cse7)) (and (and .cse12 (and .cse4 (or (and .cse6 .cse14) (or (and .cse16 (and .cse8 .cse17)) (and .cse8 .cse18)))) .cse19) .cse0 .cse7 .cse20)))) (let ((.cse23 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0))) (or (or (and (and (and .cse23 .cse10 (and .cse2 .cse9)) .cse12 .cse13 .cse14) .cse0) (and .cse23 .cse0 .cse17 .cse19 (<= .cse22 product__local__threadpooling_end_0) .cse2 .cse3)) (and .cse23 .cse2 .cse12 .cse0 .cse19 .cse18 .cse20)))))) [2018-07-23 15:15:51,185 INFO L417 ceAbstractionStarter]: At program point L214(lines 161 214) the Hoare annotation is: (let ((.cse8 (+ product__local__threadpooling_i_0 1)) (.cse3 (+ product__local__threadpooling_working_0 1))) (let ((.cse0 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))) (.cse1 (<= .cse3 product__global_next)) (.cse4 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1))) (.cse7 (= product__local__threadpooling_end_0 product__global_next)) (.cse2 (<= product__local__threadpooling_end_0 .cse8)) (.cse5 (<= .cse8 product__local__threadpooling_end_0)) (.cse6 (+ product__local__threadpooling_working_1 2))) (or (or (and (and .cse0 (= product__local__threadpooling_end_1 product__global_next) .cse1 (<= (+ product__local__threadpooling_working_1 1) product__global_next) .cse2 (<= (+ product__local__threadpooling_end_0 1) product__global_next) (<= .cse3 product__local__threadpooling_i_1)) .cse4 .cse5) (and (and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (= product__local__threadpooling_end_1 product__local__threadpooling_working_0) .cse2 (<= .cse6 product__global_next)) .cse4 .cse7 .cse5)) (and .cse0 .cse1 .cse4 .cse7 .cse2 (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_working_0) .cse5 (<= .cse6 product__local__threadpooling_end_0))))) [2018-07-23 15:15:51,186 INFO L424 ceAbstractionStarter]: At program point productENTRY(lines 3 236) the Hoare annotation is: true [2018-07-23 15:15:51,187 INFO L417 ceAbstractionStarter]: At program point L121(lines 17 229) the Hoare annotation is: (let ((.cse11 (+ product__local__threadpooling_working_1 2))) (let ((.cse1 (= product__local__threadpooling_end_1 product__global_next)) (.cse2 (<= (+ product__local__threadpooling_working_1 1) product__global_next)) (.cse5 (= product__local__threadpooling_end_0 product__global_next)) (.cse3 (<= .cse11 product__global_next)) (.cse7 (+ product__local__threadpooling_working_0 1))) (let ((.cse4 (<= .cse7 product__global_next)) (.cse6 (let ((.cse8 (let ((.cse10 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)))) (or (and .cse10 .cse1 .cse2) (or (and (and (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_end_0) .cse10 .cse5) .cse3) (and (<= .cse11 product__local__threadpooling_working_0) (<= .cse11 product__local__threadpooling_i_0) .cse3))))) (.cse9 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0))) (or (and .cse8 .cse9 (<= (+ product__local__threadpooling_end_0 1) product__global_next)) (and .cse8 (= product__global_next product__local__threadpooling_end_0) .cse9))))) (or (let ((.cse0 (<= (+ product__local__threadpooling_working_0 2) product__global_next))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3))) (and .cse4 .cse5 .cse6) (and .cse4 .cse6 (<= .cse7 product__local__threadpooling_i_1)))))) [2018-07-23 15:15:51,188 INFO L417 ceAbstractionStarter]: At program point productErr2AssertViolationASSERT(line 171) the Hoare annotation is: false [2018-07-23 15:15:51,188 INFO L421 ceAbstractionStarter]: For program point L196(lines 196 201) no Hoare annotation was computed. [2018-07-23 15:15:51,189 INFO L417 ceAbstractionStarter]: At program point L234(lines 97 234) the Hoare annotation is: (let ((.cse26 (+ product__local__threadpooling_working_1 2)) (.cse19 (= product__local__threadpooling_end_1 product__global_next)) (.cse20 (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))) (.cse22 (or (= product__local__threadpooling_end_0 product__local__threadpooling_working_1) (= product__local__threadpooling_end_0 product__local__threadpooling_i_0)))) (let ((.cse23 (and .cse19 (let ((.cse27 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)))) (or (and .cse27 .cse20) (and .cse27 .cse22))))) (.cse9 (<= .cse26 product__local__threadpooling_working_0)) (.cse15 (<= .cse26 product__local__threadpooling_i_0)) (.cse8 (<= .cse26 product__global_next)) (.cse24 (+ product__local__threadpooling_working_1 1)) (.cse25 (+ product__local__threadpooling_working_0 1))) (let ((.cse7 (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_end_0)) (.cse11 (= product__local__threadpooling_end_0 product__global_next)) (.cse4 (<= .cse25 product__global_next)) (.cse5 (<= .cse25 product__local__threadpooling_i_1)) (.cse12 (<= .cse24 product__global_next)) (.cse0 (<= (+ product__local__threadpooling_working_0 2) product__global_next)) (.cse2 (<= (+ product__local__threadpooling_end_0 1) product__global_next)) (.cse3 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse13 (= product__global_next product__local__threadpooling_end_1)) (.cse6 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse14 (or (and .cse23 (<= .cse24 product__local__threadpooling_i_0) .cse8) (and .cse9 .cse15 .cse8)))) (or (let ((.cse10 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0))) (let ((.cse1 (or (and .cse10 (and .cse12 (and .cse13 .cse6))) (and .cse14 .cse10)))) (or (and (and (and .cse0 .cse1) .cse2) .cse3) (and .cse4 (and .cse1 .cse2) .cse5) (and (or (and (and .cse6 .cse7) .cse8) .cse9) .cse10 .cse4 .cse11)))) (let ((.cse21 (+ product__local__threadpooling_i_0 1))) (let ((.cse16 (<= product__local__threadpooling_end_0 .cse21))) (let ((.cse18 (or (and (or (and .cse13 .cse22 .cse6) (and .cse23 .cse8)) .cse16) (and .cse14 .cse16))) (.cse17 (<= .cse21 product__local__threadpooling_end_0))) (or (and (and (or (and .cse7 .cse6 .cse8) .cse15) .cse4 .cse16) .cse11 .cse17) (and (and (and .cse18 .cse0) .cse2) .cse3 .cse17) (and (or (and .cse18 .cse4 .cse2 .cse5) (or (and (and (and (and .cse15 .cse19) .cse16) .cse0) .cse2) (and (and (and .cse6 .cse19 .cse12 .cse0) .cse16) .cse20 .cse2))) .cse3 .cse17))))))))) [2018-07-23 15:15:51,191 INFO L417 ceAbstractionStarter]: At program point L198(lines 32 219) the Hoare annotation is: (let ((.cse9 (+ product__local__threadpooling_working_0 1))) (let ((.cse5 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse6 (<= .cse9 product__local__threadpooling_i_1)) (.cse4 (<= .cse9 product__global_next)) (.cse0 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1)))) (or (and .cse0 (let ((.cse2 (= product__local__threadpooling_end_1 product__global_next)) (.cse3 (<= (+ product__local__threadpooling_working_1 1) product__global_next))) (or (let ((.cse1 (+ product__local__threadpooling_working_0 2))) (and (<= .cse1 product__global_next) (and .cse2 (<= .cse1 product__local__threadpooling_i_1) .cse3))) (and .cse4 (and (and (and (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)) .cse2 .cse3) .cse5) (<= (+ product__local__threadpooling_end_0 1) product__global_next)) .cse6)))) (and (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (and .cse5 (let ((.cse7 (+ product__local__threadpooling_end_1 1)) (.cse8 (<= (+ product__local__threadpooling_working_1 2) product__global_next))) (or (and (or (= product__local__threadpooling_end_1 product__local__threadpooling_working_0) (<= .cse7 product__local__threadpooling_working_0)) .cse8) (and (and (<= .cse7 product__local__threadpooling_end_0) .cse8) .cse6))) .cse4) .cse0) (= product__local__threadpooling_end_0 product__global_next))))) [2018-07-23 15:15:51,191 INFO L421 ceAbstractionStarter]: For program point L95(lines 95 190) no Hoare annotation was computed. [2018-07-23 15:15:51,192 INFO L421 ceAbstractionStarter]: For program point L119(lines 119 124) no Hoare annotation was computed. [2018-07-23 15:15:51,192 INFO L417 ceAbstractionStarter]: At program point productErr4AssertViolationASSERT(line 181) the Hoare annotation is: false [2018-07-23 15:15:51,192 INFO L417 ceAbstractionStarter]: At program point productErr3AssertViolationASSERT(line 176) the Hoare annotation is: false [2018-07-23 15:15:51,192 INFO L421 ceAbstractionStarter]: For program point productEXIT(lines 3 236) no Hoare annotation was computed. [2018-07-23 15:15:51,192 INFO L417 ceAbstractionStarter]: At program point productErr0AssertViolationASSERT(line 60) the Hoare annotation is: false [2018-07-23 15:15:51,192 INFO L421 ceAbstractionStarter]: For program point productFINAL(lines 3 236) no Hoare annotation was computed. [2018-07-23 15:15:51,192 INFO L421 ceAbstractionStarter]: For program point L43(lines 43 48) no Hoare annotation was computed. [2018-07-23 15:15:51,193 INFO L417 ceAbstractionStarter]: At program point L203(lines 143 203) the Hoare annotation is: (let ((.cse4 (+ product__local__threadpooling_working_0 1)) (.cse5 (+ product__local__threadpooling_i_0 1))) (let ((.cse1 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1))) (.cse3 (<= product__local__threadpooling_end_0 .cse5)) (.cse0 (<= .cse4 product__global_next)) (.cse2 (<= .cse5 product__local__threadpooling_end_0))) (or (and (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) .cse0 .cse1 .cse2 (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_end_0) (or (and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (= product__local__threadpooling_end_1 product__local__threadpooling_working_0) .cse3) (and (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_working_0) .cse3))) (= product__local__threadpooling_end_0 product__global_next)) (and .cse1 (and (and (and (and (<= (+ product__local__threadpooling_working_1 1) product__global_next) (and (= product__local__threadpooling_end_1 product__global_next) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)))) .cse3) (<= (+ product__local__threadpooling_end_0 1) product__global_next)) .cse0 (<= .cse4 product__local__threadpooling_i_1)) .cse2)))) [2018-07-23 15:15:51,196 INFO L417 ceAbstractionStarter]: At program point L209(lines 50 209) the Hoare annotation is: (let ((.cse9 (+ product__local__threadpooling_working_0 1))) (let ((.cse6 (<= .cse9 product__local__threadpooling_i_1)) (.cse2 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse1 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse5 (<= .cse9 product__global_next)) (.cse0 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1)))) (or (and .cse0 (let ((.cse3 (= product__local__threadpooling_end_1 product__global_next)) (.cse4 (<= (+ product__local__threadpooling_working_1 1) product__global_next))) (or (and (and .cse1 (and (and .cse2 .cse3) .cse4)) .cse5 (<= (+ product__local__threadpooling_end_0 1) product__global_next) .cse6) (and .cse3 .cse4 (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_working_1))))) (and (and (let ((.cse7 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))) (.cse8 (+ product__local__threadpooling_end_1 1))) (or (and .cse7 (<= .cse8 product__local__threadpooling_end_0) .cse6) (or (and .cse7 (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)) (and .cse2 (<= .cse8 product__local__threadpooling_working_0))))) .cse1 .cse5) .cse0 (= product__local__threadpooling_end_0 product__global_next) (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_end_0))))) [2018-07-23 15:15:51,196 INFO L421 ceAbstractionStarter]: For program point L207(lines 207 212) no Hoare annotation was computed. [2018-07-23 15:15:51,197 INFO L417 ceAbstractionStarter]: At program point L156(lines 126 185) the Hoare annotation is: (let ((.cse8 (+ product__local__threadpooling_i_0 1)) (.cse5 (+ product__local__threadpooling_working_1 2))) (let ((.cse6 (<= .cse5 product__local__threadpooling_working_0)) (.cse7 (<= product__local__threadpooling_end_0 .cse8))) (let ((.cse0 (or (and .cse7 (and (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)) (= product__local__threadpooling_end_1 product__global_next) (<= (+ product__local__threadpooling_working_1 1) product__global_next))) (and (and .cse6 (<= .cse5 product__local__threadpooling_i_0)) .cse7))) (.cse1 (<= (+ product__local__threadpooling_end_0 1) product__global_next)) (.cse2 (<= .cse8 product__local__threadpooling_end_0))) (or (and (and (and .cse0 (<= (+ product__local__threadpooling_working_0 2) product__global_next)) .cse1) (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1) .cse2) (and (let ((.cse4 (+ product__local__threadpooling_working_0 1))) (let ((.cse3 (<= .cse4 product__global_next))) (or (and .cse3 (and .cse0 .cse1) (<= .cse4 product__local__threadpooling_i_1)) (and (and (and (or (and (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_end_0) (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (<= .cse5 product__global_next)) .cse6) .cse7) (= product__local__threadpooling_end_0 product__global_next)) .cse3)))) .cse2))))) [2018-07-23 15:15:51,197 INFO L417 ceAbstractionStarter]: At program point productErr5AssertViolationASSERT(line 186) the Hoare annotation is: false [2018-07-23 15:15:51,197 INFO L421 ceAbstractionStarter]: For program point L154(lines 154 159) no Hoare annotation was computed. [2018-07-23 15:15:51,222 INFO L202 PluginConnector]: Adding new model threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 03:15:51 BoogieIcfgContainer [2018-07-23 15:15:51,222 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 15:15:51,223 INFO L168 Benchmark]: Toolchain (without parser) took 51765.44 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -223.7 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-07-23 15:15:51,224 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 15:15:51,225 INFO L168 Benchmark]: Boogie Preprocessor took 52.99 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 15:15:51,225 INFO L168 Benchmark]: RCFGBuilder took 292.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-23 15:15:51,226 INFO L168 Benchmark]: TraceAbstraction took 51415.41 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -234.3 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-07-23 15:15:51,229 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.99 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 292.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 51415.41 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -234.3 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 186]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 176]: 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: 82]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 171]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((_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 <= _global_next) || ((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1)) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) || ((((_local__threadpooling_working_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 <= _global_next) || ((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1)) && _local__threadpooling_end_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 == _local__threadpooling_working_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 + 1) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_0 + 1 <= _global_next)) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && (((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && (!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_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_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 == _local__threadpooling_working_0) || (!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_working_0)) && _local__threadpooling_end_0 <= _local__threadpooling_i_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 <= _local__threadpooling_end_0) - InvariantResult [Line: 143]: Loop Invariant Derived loop invariant: ((((((!(_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_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_working_1 + 2 <= _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_end_0 == _global_next) || ((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && ((((_local__threadpooling_working_1 + 1 <= _global_next && _local__threadpooling_end_1 == _global_next && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (((((((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) && _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_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_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 == _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_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 <= _local__threadpooling_end_0) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((_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_1 + 2 <= _global_next)) || ((_local__threadpooling_working_0 + 1 <= _global_next && _local__threadpooling_end_0 == _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_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _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_end_0 <= _local__threadpooling_i_0) && _local__threadpooling_end_0 + 1 <= _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_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _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)) && _global_next == _local__threadpooling_end_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0)))) || ((_local__threadpooling_working_0 + 1 <= _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_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _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_end_0 <= _local__threadpooling_i_0) && _local__threadpooling_end_0 + 1 <= _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_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _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)) && _global_next == _local__threadpooling_end_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0))) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && ((_local__threadpooling_working_0 + 2 <= _global_next && (_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _global_next) || ((_local__threadpooling_working_0 + 1 <= _global_next && (((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1))) || (((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && (_local__threadpooling_end_0 <= _local__threadpooling_i_0 && (((_local__threadpooling_end_1 == _local__threadpooling_working_0 || _local__threadpooling_end_1 + 1 <= _local__threadpooling_working_0) && _local__threadpooling_working_1 + 2 <= _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_working_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 == _global_next) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: (((((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && (_global_next == _local__threadpooling_end_0 && ((((!(_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 <= _local__threadpooling_i_0 + 1) || ((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && !(_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 + 2 <= _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) || (((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && (((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_end_0 + 1 <= _local__threadpooling_i_1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) || ((_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_working_0 + 1 <= _global_next) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1)) || (_local__threadpooling_i_0 == _local__threadpooling_end_1 && (((_global_next == _local__threadpooling_end_0 && ((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0)) || (((((_local__threadpooling_working_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 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || (_local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 == _local__threadpooling_working_0) || (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_working_0))) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_end_0)) || (((((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_1 + 1 <= _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_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 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0) && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_working_1 + 2 <= _global_next)) || ((((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _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_1 + 1 <= _local__threadpooling_working_0) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_end_0) - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: ((((((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && (((_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) && _global_next == _local__threadpooling_end_0) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_i_0 == _local__threadpooling_end_1) || ((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && (((_local__threadpooling_working_0 + 1 <= _global_next && ((_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_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_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_end_0 + 1 <= _global_next))) && _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 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_0 + 1 <= _global_next)))) || (_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && ((_local__threadpooling_working_0 + 1 <= _global_next && _local__threadpooling_end_0 + 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 + 1 <= _local__threadpooling_i_1)) || (((_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)) || (((((_global_next == _local__threadpooling_end_0 && _local__threadpooling_working_0 + 1 <= _global_next) && ((((_local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0 && ((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _local__threadpooling_working_0) || (!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_working_0))) || ((_local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1)) && _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_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1))) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_end_0) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((_local__threadpooling_working_0 + 2 <= _global_next && ((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_1 + 1 <= _global_next && _global_next == _local__threadpooling_end_1 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) || (((((_local__threadpooling_end_1 == _global_next && ((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) || (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && (_local__threadpooling_end_0 == _local__threadpooling_working_1 || _local__threadpooling_end_0 == _local__threadpooling_i_0)))) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0) && _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_end_0 <= _local__threadpooling_i_0))) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) || ((_local__threadpooling_working_0 + 1 <= _global_next && ((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_1 + 1 <= _global_next && _global_next == _local__threadpooling_end_1 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) || (((((_local__threadpooling_end_1 == _global_next && ((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) || (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && (_local__threadpooling_end_0 == _local__threadpooling_working_1 || _local__threadpooling_end_0 == _local__threadpooling_i_0)))) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0) && _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_end_0 <= _local__threadpooling_i_0)) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1)) || ((((((!(_local__threadpooling_working_0 == _local__threadpooling_working_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_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 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_0 + 1 <= _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_end_0 == _local__threadpooling_working_1 || _local__threadpooling_end_0 == _local__threadpooling_i_0)) && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) || ((_local__threadpooling_end_1 == _global_next && ((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) || (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && (_local__threadpooling_end_0 == _local__threadpooling_working_1 || _local__threadpooling_end_0 == _local__threadpooling_i_0)))) && _local__threadpooling_working_1 + 2 <= _global_next)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || (((((_local__threadpooling_end_1 == _global_next && ((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) || (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && (_local__threadpooling_end_0 == _local__threadpooling_working_1 || _local__threadpooling_end_0 == _local__threadpooling_i_0)))) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0) && _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_end_0 <= _local__threadpooling_i_0 + 1)) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0)) || (((((((((((_global_next == _local__threadpooling_end_1 && (_local__threadpooling_end_0 == _local__threadpooling_working_1 || _local__threadpooling_end_0 == _local__threadpooling_i_0)) && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) || ((_local__threadpooling_end_1 == _global_next && ((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) || (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && (_local__threadpooling_end_0 == _local__threadpooling_working_1 || _local__threadpooling_end_0 == _local__threadpooling_i_0)))) && _local__threadpooling_working_1 + 2 <= _global_next)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || (((((_local__threadpooling_end_1 == _global_next && ((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) || (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && (_local__threadpooling_end_0 == _local__threadpooling_working_1 || _local__threadpooling_end_0 == _local__threadpooling_i_0)))) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0) && _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_end_0 <= _local__threadpooling_i_0 + 1)) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_0 + 1 <= _global_next) && _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_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_0 + 1 <= _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 + 2 <= _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) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 6 error locations. SAFE Result, 51.3s OverallTime, 29 OverallIterations, 2 TraceHistogramMax, 13.0s AutomataDifference, 0.0s DeadEndRemovalTime, 33.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1343 SDtfs, 3075 SDslu, 1608 SDs, 0 SdLazy, 12790 SolverSat, 1740 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 358 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 328 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=274occurred in iteration=18, 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, 29 MinimizatonAttempts, 2817 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 187 NumberOfFragments, 2173 HoareAnnotationTreeSize, 16 FomulaSimplifications, -3170003851945852467 FormulaSimplificationTreeSizeReduction, 16.3s HoareSimplificationTime, 16 FomulaSimplificationsInter, 184273471152356 FormulaSimplificationTreeSizeReductionInter, 17.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 224 NumberOfCodeBlocks, 224 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 5983 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 11 PerfectInterpolantSequences, 15/56 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_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_15-15-51-246.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out2.mover.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_15-15-51-246.csv Received shutdown request...