java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/real-life/threadpooling_product.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:15:57,176 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:15:57,178 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:15:57,190 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:15:57,191 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:15:57,192 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:15:57,193 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:15:57,195 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:15:57,197 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:15:57,198 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:15:57,199 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:15:57,199 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:15:57,200 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:15:57,201 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:15:57,202 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:15:57,203 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:15:57,204 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:15:57,206 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:15:57,208 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:15:57,209 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:15:57,211 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:15:57,212 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:15:57,214 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:15:57,215 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:15:57,215 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:15:57,216 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:15:57,217 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:15:57,218 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:15:57,219 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:15:57,220 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:15:57,220 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:15:57,221 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:15:57,221 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:15:57,221 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:15:57,222 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:15:57,223 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:15:57,223 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 13:15:57,235 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:15:57,236 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:15:57,238 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:15:57,238 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:15:57,239 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:15:57,239 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:15:57,239 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:15:57,239 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:15:57,283 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:15:57,296 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:15:57,301 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:15:57,303 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:15:57,304 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:15:57,304 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl [2018-07-25 13:15:57,305 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl' [2018-07-25 13:15:57,365 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:15:57,368 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:15:57,369 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:15:57,369 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:15:57,369 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:15:57,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:57" (1/1) ... [2018-07-25 13:15:57,402 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:57" (1/1) ... [2018-07-25 13:15:57,408 WARN L165 Inliner]: Program contained no entry procedure! [2018-07-25 13:15:57,408 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-07-25 13:15:57,408 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-07-25 13:15:57,410 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:15:57,411 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:15:57,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:15:57,412 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:15:57,426 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:57" (1/1) ... [2018-07-25 13:15:57,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:57" (1/1) ... [2018-07-25 13:15:57,427 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:57" (1/1) ... [2018-07-25 13:15:57,428 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:57" (1/1) ... [2018-07-25 13:15:57,432 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:57" (1/1) ... [2018-07-25 13:15:57,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:57" (1/1) ... [2018-07-25 13:15:57,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:57" (1/1) ... [2018-07-25 13:15:57,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:15:57,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:15:57,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:15:57,441 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:15:57,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:57" (1/1) ... [2018-07-25 13:15:57,532 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-07-25 13:15:57,532 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-07-25 13:15:57,533 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-07-25 13:15:57,756 INFO L270 CfgBuilder]: Using library mode [2018-07-25 13:15:57,757 INFO L202 PluginConnector]: Adding new model threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:15:57 BoogieIcfgContainer [2018-07-25 13:15:57,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:15:57,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:15:57,761 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:15:57,764 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:15:57,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:57" (1/2) ... [2018-07-25 13:15:57,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d614b7 and model type threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:15:57, skipping insertion in model container [2018-07-25 13:15:57,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:15:57" (2/2) ... [2018-07-25 13:15:57,771 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product.bpl [2018-07-25 13:15:57,781 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:15:57,790 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-07-25 13:15:57,838 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:15:57,839 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:15:57,839 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:15:57,839 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:15:57,840 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:15:57,840 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:15:57,840 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:15:57,840 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:15:57,841 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:15:57,855 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-07-25 13:15:57,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-25 13:15:57,864 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:57,865 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-07-25 13:15:57,867 INFO L415 AbstractCegarLoop]: === Iteration 1 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:57,872 INFO L82 PathProgramCache]: Analyzing trace with hash 28755683, now seen corresponding path program 1 times [2018-07-25 13:15:57,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:57,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:57,975 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:57,976 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:15:57,980 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:15:57,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:15:57,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:15:57,997 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2018-07-25 13:15:58,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:58,251 INFO L93 Difference]: Finished difference Result 49 states and 85 transitions. [2018-07-25 13:15:58,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:15:58,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-07-25 13:15:58,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:58,281 INFO L225 Difference]: With dead ends: 49 [2018-07-25 13:15:58,281 INFO L226 Difference]: Without dead ends: 47 [2018-07-25 13:15:58,286 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:15:58,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-25 13:15:58,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2018-07-25 13:15:58,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-25 13:15:58,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2018-07-25 13:15:58,332 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 5 [2018-07-25 13:15:58,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:58,333 INFO L472 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2018-07-25 13:15:58,333 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:15:58,334 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2018-07-25 13:15:58,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-25 13:15:58,334 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:58,335 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-07-25 13:15:58,335 INFO L415 AbstractCegarLoop]: === Iteration 2 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:58,335 INFO L82 PathProgramCache]: Analyzing trace with hash 28971747, now seen corresponding path program 1 times [2018-07-25 13:15:58,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:58,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:58,367 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:58,367 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:15:58,369 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:15:58,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:15:58,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:15:58,370 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 5 states. [2018-07-25 13:15:58,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:58,542 INFO L93 Difference]: Finished difference Result 57 states and 99 transitions. [2018-07-25 13:15:58,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:15:58,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-07-25 13:15:58,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:58,544 INFO L225 Difference]: With dead ends: 57 [2018-07-25 13:15:58,544 INFO L226 Difference]: Without dead ends: 55 [2018-07-25 13:15:58,546 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:15:58,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-25 13:15:58,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2018-07-25 13:15:58,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-25 13:15:58,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 63 transitions. [2018-07-25 13:15:58,559 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 63 transitions. Word has length 5 [2018-07-25 13:15:58,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:58,559 INFO L472 AbstractCegarLoop]: Abstraction has 38 states and 63 transitions. [2018-07-25 13:15:58,560 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:15:58,560 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 63 transitions. [2018-07-25 13:15:58,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:15:58,561 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:58,561 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:58,561 INFO L415 AbstractCegarLoop]: === Iteration 3 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:58,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1864688358, now seen corresponding path program 1 times [2018-07-25 13:15:58,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:58,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:58,627 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:58,627 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:15:58,627 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:58,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:58,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:58,628 INFO L87 Difference]: Start difference. First operand 38 states and 63 transitions. Second operand 7 states. [2018-07-25 13:15:58,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:58,915 INFO L93 Difference]: Finished difference Result 84 states and 147 transitions. [2018-07-25 13:15:58,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:15:58,916 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-07-25 13:15:58,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:58,918 INFO L225 Difference]: With dead ends: 84 [2018-07-25 13:15:58,918 INFO L226 Difference]: Without dead ends: 82 [2018-07-25 13:15:58,919 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:15:58,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-07-25 13:15:58,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 51. [2018-07-25 13:15:58,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-25 13:15:58,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 86 transitions. [2018-07-25 13:15:58,937 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 86 transitions. Word has length 7 [2018-07-25 13:15:58,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:58,938 INFO L472 AbstractCegarLoop]: Abstraction has 51 states and 86 transitions. [2018-07-25 13:15:58,938 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:58,938 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 86 transitions. [2018-07-25 13:15:58,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:15:58,939 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:58,939 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-07-25 13:15:58,940 INFO L415 AbstractCegarLoop]: === Iteration 4 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:58,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1865765160, now seen corresponding path program 1 times [2018-07-25 13:15:58,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:58,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:58,987 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:58,989 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:15:58,990 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:58,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:58,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:58,991 INFO L87 Difference]: Start difference. First operand 51 states and 86 transitions. Second operand 7 states. [2018-07-25 13:15:59,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:59,155 INFO L93 Difference]: Finished difference Result 102 states and 180 transitions. [2018-07-25 13:15:59,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:15:59,156 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-07-25 13:15:59,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:59,160 INFO L225 Difference]: With dead ends: 102 [2018-07-25 13:15:59,160 INFO L226 Difference]: Without dead ends: 100 [2018-07-25 13:15:59,161 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:15:59,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-07-25 13:15:59,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 65. [2018-07-25 13:15:59,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 13:15:59,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 111 transitions. [2018-07-25 13:15:59,185 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 111 transitions. Word has length 7 [2018-07-25 13:15:59,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:59,185 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 111 transitions. [2018-07-25 13:15:59,186 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:59,186 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 111 transitions. [2018-07-25 13:15:59,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 13:15:59,190 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:59,191 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:59,191 INFO L415 AbstractCegarLoop]: === Iteration 5 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:59,192 INFO L82 PathProgramCache]: Analyzing trace with hash 964893579, now seen corresponding path program 1 times [2018-07-25 13:15:59,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:59,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:59,245 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:59,246 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:15:59,246 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:15:59,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:15:59,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:15:59,249 INFO L87 Difference]: Start difference. First operand 65 states and 111 transitions. Second operand 9 states. [2018-07-25 13:15:59,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:59,480 INFO L93 Difference]: Finished difference Result 113 states and 199 transitions. [2018-07-25 13:15:59,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:15:59,481 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-07-25 13:15:59,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:59,483 INFO L225 Difference]: With dead ends: 113 [2018-07-25 13:15:59,484 INFO L226 Difference]: Without dead ends: 112 [2018-07-25 13:15:59,489 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:15:59,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-07-25 13:15:59,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 74. [2018-07-25 13:15:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-07-25 13:15:59,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 128 transitions. [2018-07-25 13:15:59,520 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 128 transitions. Word has length 9 [2018-07-25 13:15:59,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:59,521 INFO L472 AbstractCegarLoop]: Abstraction has 74 states and 128 transitions. [2018-07-25 13:15:59,521 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:15:59,521 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 128 transitions. [2018-07-25 13:15:59,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 13:15:59,522 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:59,522 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:59,523 INFO L415 AbstractCegarLoop]: === Iteration 6 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:59,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1999237099, now seen corresponding path program 1 times [2018-07-25 13:15:59,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:59,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:59,571 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:59,571 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:15:59,572 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:15:59,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:15:59,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:15:59,573 INFO L87 Difference]: Start difference. First operand 74 states and 128 transitions. Second operand 9 states. [2018-07-25 13:15:59,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:59,894 INFO L93 Difference]: Finished difference Result 133 states and 236 transitions. [2018-07-25 13:15:59,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:15:59,895 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-07-25 13:15:59,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:59,896 INFO L225 Difference]: With dead ends: 133 [2018-07-25 13:15:59,897 INFO L226 Difference]: Without dead ends: 132 [2018-07-25 13:15:59,897 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:15:59,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-07-25 13:15:59,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 83. [2018-07-25 13:15:59,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-25 13:15:59,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 145 transitions. [2018-07-25 13:15:59,923 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 145 transitions. Word has length 9 [2018-07-25 13:15:59,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:59,924 INFO L472 AbstractCegarLoop]: Abstraction has 83 states and 145 transitions. [2018-07-25 13:15:59,924 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:15:59,924 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 145 transitions. [2018-07-25 13:15:59,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 13:15:59,925 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:59,925 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-07-25 13:15:59,926 INFO L415 AbstractCegarLoop]: === Iteration 7 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:59,926 INFO L82 PathProgramCache]: Analyzing trace with hash 2000313901, now seen corresponding path program 2 times [2018-07-25 13:15:59,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:59,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:59,935 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-25 13:15:59,935 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:59,936 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:15:59,936 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:15:59,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:15:59,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:15:59,937 INFO L87 Difference]: Start difference. First operand 83 states and 145 transitions. Second operand 4 states. [2018-07-25 13:15:59,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:59,966 INFO L93 Difference]: Finished difference Result 119 states and 205 transitions. [2018-07-25 13:15:59,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:15:59,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-07-25 13:15:59,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:59,968 INFO L225 Difference]: With dead ends: 119 [2018-07-25 13:15:59,968 INFO L226 Difference]: Without dead ends: 76 [2018-07-25 13:15:59,969 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:15:59,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-07-25 13:16:00,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-07-25 13:16:00,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-07-25 13:16:00,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 124 transitions. [2018-07-25 13:16:00,003 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 124 transitions. Word has length 9 [2018-07-25 13:16:00,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:00,004 INFO L472 AbstractCegarLoop]: Abstraction has 76 states and 124 transitions. [2018-07-25 13:16:00,004 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:16:00,004 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 124 transitions. [2018-07-25 13:16:00,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 13:16:00,005 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:00,006 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-07-25 13:16:00,006 INFO L415 AbstractCegarLoop]: === Iteration 8 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:00,006 INFO L82 PathProgramCache]: Analyzing trace with hash -855455763, now seen corresponding path program 1 times [2018-07-25 13:16:00,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:00,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 13:16:00,025 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:00,026 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:16:00,027 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:16:00,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:16:00,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:16:00,029 INFO L87 Difference]: Start difference. First operand 76 states and 124 transitions. Second operand 4 states. [2018-07-25 13:16:00,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:00,062 INFO L93 Difference]: Finished difference Result 111 states and 178 transitions. [2018-07-25 13:16:00,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:16:00,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-07-25 13:16:00,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:00,064 INFO L225 Difference]: With dead ends: 111 [2018-07-25 13:16:00,064 INFO L226 Difference]: Without dead ends: 65 [2018-07-25 13:16:00,065 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:16:00,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-25 13:16:00,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-25 13:16:00,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 13:16:00,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 96 transitions. [2018-07-25 13:16:00,085 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 96 transitions. Word has length 9 [2018-07-25 13:16:00,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:00,086 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 96 transitions. [2018-07-25 13:16:00,086 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:16:00,086 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 96 transitions. [2018-07-25 13:16:00,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:16:00,090 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:00,091 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:00,091 INFO L415 AbstractCegarLoop]: === Iteration 9 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:00,092 INFO L82 PathProgramCache]: Analyzing trace with hash 101966393, now seen corresponding path program 1 times [2018-07-25 13:16:00,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:00,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:00,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:00,157 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:00,157 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:00,157 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:00,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:00,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:00,158 INFO L87 Difference]: Start difference. First operand 65 states and 96 transitions. Second operand 8 states. [2018-07-25 13:16:00,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:00,309 INFO L93 Difference]: Finished difference Result 97 states and 143 transitions. [2018-07-25 13:16:00,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:16:00,309 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-25 13:16:00,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:00,310 INFO L225 Difference]: With dead ends: 97 [2018-07-25 13:16:00,310 INFO L226 Difference]: Without dead ends: 96 [2018-07-25 13:16:00,312 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:16:00,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-07-25 13:16:00,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 81. [2018-07-25 13:16:00,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-25 13:16:00,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 126 transitions. [2018-07-25 13:16:00,346 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 126 transitions. Word has length 10 [2018-07-25 13:16:00,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:00,346 INFO L472 AbstractCegarLoop]: Abstraction has 81 states and 126 transitions. [2018-07-25 13:16:00,347 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:00,347 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 126 transitions. [2018-07-25 13:16:00,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:16:00,348 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:00,348 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:00,353 INFO L415 AbstractCegarLoop]: === Iteration 10 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:00,353 INFO L82 PathProgramCache]: Analyzing trace with hash 103259259, now seen corresponding path program 1 times [2018-07-25 13:16:00,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:00,388 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-25 13:16:00,389 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:00,389 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:16:00,390 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:00,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:00,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:00,391 INFO L87 Difference]: Start difference. First operand 81 states and 126 transitions. Second operand 8 states. [2018-07-25 13:16:00,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:00,536 INFO L93 Difference]: Finished difference Result 104 states and 152 transitions. [2018-07-25 13:16:00,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:16:00,536 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-25 13:16:00,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:00,537 INFO L225 Difference]: With dead ends: 104 [2018-07-25 13:16:00,538 INFO L226 Difference]: Without dead ends: 102 [2018-07-25 13:16:00,538 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:16:00,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-07-25 13:16:00,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 85. [2018-07-25 13:16:00,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-25 13:16:00,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 134 transitions. [2018-07-25 13:16:00,565 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 134 transitions. Word has length 10 [2018-07-25 13:16:00,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:00,565 INFO L472 AbstractCegarLoop]: Abstraction has 85 states and 134 transitions. [2018-07-25 13:16:00,565 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:00,566 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 134 transitions. [2018-07-25 13:16:00,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:16:00,572 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:00,572 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:00,573 INFO L415 AbstractCegarLoop]: === Iteration 11 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:00,573 INFO L82 PathProgramCache]: Analyzing trace with hash -176034144, now seen corresponding path program 1 times [2018-07-25 13:16:00,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:00,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:00,599 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:00,605 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:16:00,606 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:00,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:00,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:00,607 INFO L87 Difference]: Start difference. First operand 85 states and 134 transitions. Second operand 8 states. [2018-07-25 13:16:00,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:00,689 INFO L93 Difference]: Finished difference Result 91 states and 143 transitions. [2018-07-25 13:16:00,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 13:16:00,690 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-25 13:16:00,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:00,691 INFO L225 Difference]: With dead ends: 91 [2018-07-25 13:16:00,692 INFO L226 Difference]: Without dead ends: 90 [2018-07-25 13:16:00,692 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:00,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-07-25 13:16:00,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2018-07-25 13:16:00,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-07-25 13:16:00,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 132 transitions. [2018-07-25 13:16:00,723 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 132 transitions. Word has length 10 [2018-07-25 13:16:00,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:00,724 INFO L472 AbstractCegarLoop]: Abstraction has 84 states and 132 transitions. [2018-07-25 13:16:00,724 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:00,724 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 132 transitions. [2018-07-25 13:16:00,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:16:00,725 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:00,725 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:00,725 INFO L415 AbstractCegarLoop]: === Iteration 12 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:00,726 INFO L82 PathProgramCache]: Analyzing trace with hash -176034432, now seen corresponding path program 1 times [2018-07-25 13:16:00,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:00,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:00,747 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:00,747 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:16:00,748 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:00,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:00,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:00,749 INFO L87 Difference]: Start difference. First operand 84 states and 132 transitions. Second operand 7 states. [2018-07-25 13:16:00,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:00,901 INFO L93 Difference]: Finished difference Result 108 states and 159 transitions. [2018-07-25 13:16:00,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:16:00,902 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-07-25 13:16:00,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:00,903 INFO L225 Difference]: With dead ends: 108 [2018-07-25 13:16:00,903 INFO L226 Difference]: Without dead ends: 106 [2018-07-25 13:16:00,904 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:16:00,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-07-25 13:16:00,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 95. [2018-07-25 13:16:00,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-25 13:16:00,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 149 transitions. [2018-07-25 13:16:00,934 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 149 transitions. Word has length 10 [2018-07-25 13:16:00,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:00,934 INFO L472 AbstractCegarLoop]: Abstraction has 95 states and 149 transitions. [2018-07-25 13:16:00,935 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:00,935 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 149 transitions. [2018-07-25 13:16:00,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:16:00,936 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:00,936 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:00,937 INFO L415 AbstractCegarLoop]: === Iteration 13 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:00,937 INFO L82 PathProgramCache]: Analyzing trace with hash -184622601, now seen corresponding path program 1 times [2018-07-25 13:16:00,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:00,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:00,977 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:00,977 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:00,977 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:00,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:00,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:00,980 INFO L87 Difference]: Start difference. First operand 95 states and 149 transitions. Second operand 8 states. [2018-07-25 13:16:01,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:01,135 INFO L93 Difference]: Finished difference Result 116 states and 171 transitions. [2018-07-25 13:16:01,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:16:01,135 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-25 13:16:01,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:01,136 INFO L225 Difference]: With dead ends: 116 [2018-07-25 13:16:01,137 INFO L226 Difference]: Without dead ends: 115 [2018-07-25 13:16:01,137 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:16:01,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-25 13:16:01,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 100. [2018-07-25 13:16:01,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-07-25 13:16:01,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 158 transitions. [2018-07-25 13:16:01,168 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 158 transitions. Word has length 10 [2018-07-25 13:16:01,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:01,168 INFO L472 AbstractCegarLoop]: Abstraction has 100 states and 158 transitions. [2018-07-25 13:16:01,169 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:01,169 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 158 transitions. [2018-07-25 13:16:01,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:16:01,169 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:01,170 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:01,170 INFO L415 AbstractCegarLoop]: === Iteration 14 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:01,170 INFO L82 PathProgramCache]: Analyzing trace with hash -184621319, now seen corresponding path program 1 times [2018-07-25 13:16:01,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16: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-25 13:16:01,210 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:01,210 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:16:01,211 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:01,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:01,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:01,211 INFO L87 Difference]: Start difference. First operand 100 states and 158 transitions. Second operand 8 states. [2018-07-25 13:16:01,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:01,361 INFO L93 Difference]: Finished difference Result 116 states and 171 transitions. [2018-07-25 13:16:01,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:16:01,362 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-25 13:16:01,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:01,363 INFO L225 Difference]: With dead ends: 116 [2018-07-25 13:16:01,363 INFO L226 Difference]: Without dead ends: 114 [2018-07-25 13:16:01,364 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:16:01,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-07-25 13:16:01,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 100. [2018-07-25 13:16:01,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-07-25 13:16:01,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 158 transitions. [2018-07-25 13:16:01,394 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 158 transitions. Word has length 10 [2018-07-25 13:16:01,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:01,395 INFO L472 AbstractCegarLoop]: Abstraction has 100 states and 158 transitions. [2018-07-25 13:16:01,395 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:01,395 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 158 transitions. [2018-07-25 13:16:01,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:16:01,396 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:01,396 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:01,396 INFO L415 AbstractCegarLoop]: === Iteration 15 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:01,397 INFO L82 PathProgramCache]: Analyzing trace with hash -973282432, now seen corresponding path program 1 times [2018-07-25 13:16:01,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:01,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:01,435 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:01,435 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:01,436 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:01,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:01,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:01,437 INFO L87 Difference]: Start difference. First operand 100 states and 158 transitions. Second operand 8 states. [2018-07-25 13:16:01,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:01,579 INFO L93 Difference]: Finished difference Result 124 states and 186 transitions. [2018-07-25 13:16:01,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:16:01,579 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-25 13:16:01,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:01,581 INFO L225 Difference]: With dead ends: 124 [2018-07-25 13:16:01,581 INFO L226 Difference]: Without dead ends: 123 [2018-07-25 13:16:01,581 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:16:01,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-25 13:16:01,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2018-07-25 13:16:01,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-25 13:16:01,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 167 transitions. [2018-07-25 13:16:01,618 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 167 transitions. Word has length 10 [2018-07-25 13:16:01,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:01,619 INFO L472 AbstractCegarLoop]: Abstraction has 105 states and 167 transitions. [2018-07-25 13:16:01,619 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:01,619 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 167 transitions. [2018-07-25 13:16:01,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:16:01,619 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:01,620 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:01,620 INFO L415 AbstractCegarLoop]: === Iteration 16 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:01,620 INFO L82 PathProgramCache]: Analyzing trace with hash -973281662, now seen corresponding path program 1 times [2018-07-25 13:16:01,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:01,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:01,647 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:01,647 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:16:01,647 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:01,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:01,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:01,648 INFO L87 Difference]: Start difference. First operand 105 states and 167 transitions. Second operand 8 states. [2018-07-25 13:16:01,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:01,802 INFO L93 Difference]: Finished difference Result 124 states and 186 transitions. [2018-07-25 13:16:01,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:16:01,802 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-25 13:16:01,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:01,803 INFO L225 Difference]: With dead ends: 124 [2018-07-25 13:16:01,803 INFO L226 Difference]: Without dead ends: 122 [2018-07-25 13:16:01,805 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:16:01,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-07-25 13:16:01,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2018-07-25 13:16:01,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-07-25 13:16:01,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 172 transitions. [2018-07-25 13:16:01,842 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 172 transitions. Word has length 10 [2018-07-25 13:16:01,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:01,843 INFO L472 AbstractCegarLoop]: Abstraction has 108 states and 172 transitions. [2018-07-25 13:16:01,843 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:01,843 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 172 transitions. [2018-07-25 13:16:01,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:16:01,844 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:01,844 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:01,844 INFO L415 AbstractCegarLoop]: === Iteration 17 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:01,845 INFO L82 PathProgramCache]: Analyzing trace with hash -981870601, now seen corresponding path program 1 times [2018-07-25 13:16:01,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:01,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:01,859 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:01,859 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:16:01,859 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:01,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:01,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:01,860 INFO L87 Difference]: Start difference. First operand 108 states and 172 transitions. Second operand 7 states. [2018-07-25 13:16:01,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:01,989 INFO L93 Difference]: Finished difference Result 129 states and 195 transitions. [2018-07-25 13:16:01,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:16:01,990 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-07-25 13:16:01,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:01,991 INFO L225 Difference]: With dead ends: 129 [2018-07-25 13:16:01,991 INFO L226 Difference]: Without dead ends: 127 [2018-07-25 13:16:01,992 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:16:01,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-25 13:16:02,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2018-07-25 13:16:02,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-25 13:16:02,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 189 transitions. [2018-07-25 13:16:02,031 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 189 transitions. Word has length 10 [2018-07-25 13:16:02,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:02,031 INFO L472 AbstractCegarLoop]: Abstraction has 119 states and 189 transitions. [2018-07-25 13:16:02,031 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:02,031 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 189 transitions. [2018-07-25 13:16:02,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:16:02,032 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:02,032 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:02,033 INFO L415 AbstractCegarLoop]: === Iteration 18 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:02,033 INFO L82 PathProgramCache]: Analyzing trace with hash -981870889, now seen corresponding path program 1 times [2018-07-25 13:16:02,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:02,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:02,056 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:02,056 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:16:02,056 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:02,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:02,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:02,057 INFO L87 Difference]: Start difference. First operand 119 states and 189 transitions. Second operand 8 states. [2018-07-25 13:16:02,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:02,150 INFO L93 Difference]: Finished difference Result 129 states and 206 transitions. [2018-07-25 13:16:02,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 13:16:02,150 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-25 13:16:02,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:02,151 INFO L225 Difference]: With dead ends: 129 [2018-07-25 13:16:02,152 INFO L226 Difference]: Without dead ends: 128 [2018-07-25 13:16:02,152 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:02,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-07-25 13:16:02,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 121. [2018-07-25 13:16:02,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-25 13:16:02,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 193 transitions. [2018-07-25 13:16:02,191 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 193 transitions. Word has length 10 [2018-07-25 13:16:02,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:02,192 INFO L472 AbstractCegarLoop]: Abstraction has 121 states and 193 transitions. [2018-07-25 13:16:02,192 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:02,192 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 193 transitions. [2018-07-25 13:16:02,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:16:02,193 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:02,193 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:02,193 INFO L415 AbstractCegarLoop]: === Iteration 19 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:02,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1101306322, now seen corresponding path program 1 times [2018-07-25 13:16:02,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:02,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:02,277 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:02,278 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:02,278 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:02,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:02,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:02,279 INFO L87 Difference]: Start difference. First operand 121 states and 193 transitions. Second operand 8 states. [2018-07-25 13:16:02,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:02,418 INFO L93 Difference]: Finished difference Result 137 states and 209 transitions. [2018-07-25 13:16:02,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:16:02,419 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-25 13:16:02,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:02,420 INFO L225 Difference]: With dead ends: 137 [2018-07-25 13:16:02,420 INFO L226 Difference]: Without dead ends: 136 [2018-07-25 13:16:02,421 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:16:02,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-07-25 13:16:02,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 129. [2018-07-25 13:16:02,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-25 13:16:02,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 206 transitions. [2018-07-25 13:16:02,457 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 206 transitions. Word has length 10 [2018-07-25 13:16:02,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:02,457 INFO L472 AbstractCegarLoop]: Abstraction has 129 states and 206 transitions. [2018-07-25 13:16:02,457 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:02,457 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 206 transitions. [2018-07-25 13:16:02,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:16:02,458 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:02,458 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:02,458 INFO L415 AbstractCegarLoop]: === Iteration 20 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:02,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1102106644, now seen corresponding path program 1 times [2018-07-25 13:16:02,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:02,479 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-25 13:16:02,480 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:02,480 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:16:02,481 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:02,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:02,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:02,482 INFO L87 Difference]: Start difference. First operand 129 states and 206 transitions. Second operand 8 states. [2018-07-25 13:16:02,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:02,608 INFO L93 Difference]: Finished difference Result 147 states and 223 transitions. [2018-07-25 13:16:02,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:16:02,608 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-25 13:16:02,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:02,609 INFO L225 Difference]: With dead ends: 147 [2018-07-25 13:16:02,609 INFO L226 Difference]: Without dead ends: 145 [2018-07-25 13:16:02,610 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:16:02,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-25 13:16:02,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 129. [2018-07-25 13:16:02,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-25 13:16:02,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 206 transitions. [2018-07-25 13:16:02,644 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 206 transitions. Word has length 10 [2018-07-25 13:16:02,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:02,645 INFO L472 AbstractCegarLoop]: Abstraction has 129 states and 206 transitions. [2018-07-25 13:16:02,645 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:02,645 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 206 transitions. [2018-07-25 13:16:02,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:16:02,646 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:02,646 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:02,646 INFO L415 AbstractCegarLoop]: === Iteration 21 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:02,646 INFO L82 PathProgramCache]: Analyzing trace with hash 240543358, now seen corresponding path program 1 times [2018-07-25 13:16:02,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:02,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:02,680 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:02,680 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:16:02,680 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:16:02,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:16:02,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:02,681 INFO L87 Difference]: Start difference. First operand 129 states and 206 transitions. Second operand 10 states. [2018-07-25 13:16:02,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:02,871 INFO L93 Difference]: Finished difference Result 151 states and 226 transitions. [2018-07-25 13:16:02,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:16:02,872 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2018-07-25 13:16:02,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:02,873 INFO L225 Difference]: With dead ends: 151 [2018-07-25 13:16:02,873 INFO L226 Difference]: Without dead ends: 150 [2018-07-25 13:16:02,874 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:16:02,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-07-25 13:16:02,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 121. [2018-07-25 13:16:02,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-25 13:16:02,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 192 transitions. [2018-07-25 13:16:02,912 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 192 transitions. Word has length 12 [2018-07-25 13:16:02,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:02,912 INFO L472 AbstractCegarLoop]: Abstraction has 121 states and 192 transitions. [2018-07-25 13:16:02,912 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:16:02,913 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 192 transitions. [2018-07-25 13:16:02,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:16:02,913 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:02,913 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:02,914 INFO L415 AbstractCegarLoop]: === Iteration 22 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:02,914 INFO L82 PathProgramCache]: Analyzing trace with hash 447688542, now seen corresponding path program 1 times [2018-07-25 13:16:02,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:02,946 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-25 13:16:02,947 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:02,947 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-07-25 13:16:02,947 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:16:02,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:16:02,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:02,948 INFO L87 Difference]: Start difference. First operand 121 states and 192 transitions. Second operand 10 states. [2018-07-25 13:16:03,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:03,099 INFO L93 Difference]: Finished difference Result 149 states and 233 transitions. [2018-07-25 13:16:03,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:16:03,100 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2018-07-25 13:16:03,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:03,101 INFO L225 Difference]: With dead ends: 149 [2018-07-25 13:16:03,101 INFO L226 Difference]: Without dead ends: 147 [2018-07-25 13:16:03,102 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:16:03,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-25 13:16:03,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 136. [2018-07-25 13:16:03,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-07-25 13:16:03,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 216 transitions. [2018-07-25 13:16:03,148 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 216 transitions. Word has length 12 [2018-07-25 13:16:03,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:03,148 INFO L472 AbstractCegarLoop]: Abstraction has 136 states and 216 transitions. [2018-07-25 13:16:03,148 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:16:03,149 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 216 transitions. [2018-07-25 13:16:03,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:16:03,149 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:03,149 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:03,150 INFO L415 AbstractCegarLoop]: === Iteration 23 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:03,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1316178012, now seen corresponding path program 1 times [2018-07-25 13:16:03,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:03,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:03,169 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:03,169 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:03,169 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:03,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:03,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:03,170 INFO L87 Difference]: Start difference. First operand 136 states and 216 transitions. Second operand 9 states. [2018-07-25 13:16:03,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:03,289 INFO L93 Difference]: Finished difference Result 145 states and 230 transitions. [2018-07-25 13:16:03,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:16:03,289 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-25 13:16:03,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:03,290 INFO L225 Difference]: With dead ends: 145 [2018-07-25 13:16:03,291 INFO L226 Difference]: Without dead ends: 144 [2018-07-25 13:16:03,291 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:16:03,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-07-25 13:16:03,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-07-25 13:16:03,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-07-25 13:16:03,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 229 transitions. [2018-07-25 13:16:03,339 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 229 transitions. Word has length 12 [2018-07-25 13:16:03,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:03,339 INFO L472 AbstractCegarLoop]: Abstraction has 144 states and 229 transitions. [2018-07-25 13:16:03,339 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:03,340 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 229 transitions. [2018-07-25 13:16:03,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:16:03,340 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:03,340 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:03,341 INFO L415 AbstractCegarLoop]: === Iteration 24 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:03,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1525011273, now seen corresponding path program 1 times [2018-07-25 13:16:03,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:03,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:03,366 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:03,366 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:16:03,367 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:16:03,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:16:03,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:03,367 INFO L87 Difference]: Start difference. First operand 144 states and 229 transitions. Second operand 10 states. [2018-07-25 13:16:03,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:03,582 INFO L93 Difference]: Finished difference Result 168 states and 253 transitions. [2018-07-25 13:16:03,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:16:03,583 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2018-07-25 13:16:03,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:03,584 INFO L225 Difference]: With dead ends: 168 [2018-07-25 13:16:03,584 INFO L226 Difference]: Without dead ends: 167 [2018-07-25 13:16:03,585 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:16:03,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-25 13:16:03,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 137. [2018-07-25 13:16:03,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-25 13:16:03,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 217 transitions. [2018-07-25 13:16:03,634 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 217 transitions. Word has length 12 [2018-07-25 13:16:03,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:03,634 INFO L472 AbstractCegarLoop]: Abstraction has 137 states and 217 transitions. [2018-07-25 13:16:03,635 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:16:03,635 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 217 transitions. [2018-07-25 13:16:03,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:16:03,635 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:03,635 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:03,636 INFO L415 AbstractCegarLoop]: === Iteration 25 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:03,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1139034733, now seen corresponding path program 1 times [2018-07-25 13:16:03,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:03,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:03,661 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:03,661 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:03,661 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:03,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:03,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:03,662 INFO L87 Difference]: Start difference. First operand 137 states and 217 transitions. Second operand 9 states. [2018-07-25 13:16:03,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:03,795 INFO L93 Difference]: Finished difference Result 164 states and 254 transitions. [2018-07-25 13:16:03,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:16:03,795 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-25 13:16:03,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:03,797 INFO L225 Difference]: With dead ends: 164 [2018-07-25 13:16:03,797 INFO L226 Difference]: Without dead ends: 163 [2018-07-25 13:16:03,798 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:16:03,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-07-25 13:16:03,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 151. [2018-07-25 13:16:03,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-25 13:16:03,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 241 transitions. [2018-07-25 13:16:03,859 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 241 transitions. Word has length 13 [2018-07-25 13:16:03,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:03,860 INFO L472 AbstractCegarLoop]: Abstraction has 151 states and 241 transitions. [2018-07-25 13:16:03,860 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:03,860 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 241 transitions. [2018-07-25 13:16:03,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:16:03,861 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:03,861 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:03,862 INFO L415 AbstractCegarLoop]: === Iteration 26 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:03,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1000080215, now seen corresponding path program 1 times [2018-07-25 13:16:03,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:03,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:03,882 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:03,882 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:03,883 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:03,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:03,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:03,884 INFO L87 Difference]: Start difference. First operand 151 states and 241 transitions. Second operand 9 states. [2018-07-25 13:16:04,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:04,093 INFO L93 Difference]: Finished difference Result 217 states and 338 transitions. [2018-07-25 13:16:04,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:16:04,093 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-25 13:16:04,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:04,095 INFO L225 Difference]: With dead ends: 217 [2018-07-25 13:16:04,095 INFO L226 Difference]: Without dead ends: 215 [2018-07-25 13:16:04,096 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:16:04,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-07-25 13:16:04,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 163. [2018-07-25 13:16:04,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-07-25 13:16:04,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 260 transitions. [2018-07-25 13:16:04,159 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 260 transitions. Word has length 13 [2018-07-25 13:16:04,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:04,159 INFO L472 AbstractCegarLoop]: Abstraction has 163 states and 260 transitions. [2018-07-25 13:16:04,159 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:04,159 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 260 transitions. [2018-07-25 13:16:04,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:16:04,160 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:04,160 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:04,161 INFO L415 AbstractCegarLoop]: === Iteration 27 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:04,161 INFO L82 PathProgramCache]: Analyzing trace with hash -86604803, now seen corresponding path program 1 times [2018-07-25 13:16:04,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:04,185 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:04,185 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:04,186 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:04,186 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:04,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:04,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:04,187 INFO L87 Difference]: Start difference. First operand 163 states and 260 transitions. Second operand 9 states. [2018-07-25 13:16:04,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:04,377 INFO L93 Difference]: Finished difference Result 208 states and 319 transitions. [2018-07-25 13:16:04,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:16:04,377 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-25 13:16:04,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:04,379 INFO L225 Difference]: With dead ends: 208 [2018-07-25 13:16:04,379 INFO L226 Difference]: Without dead ends: 207 [2018-07-25 13:16:04,379 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:16:04,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-07-25 13:16:04,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 173. [2018-07-25 13:16:04,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-25 13:16:04,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 277 transitions. [2018-07-25 13:16:04,451 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 277 transitions. Word has length 13 [2018-07-25 13:16:04,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:04,451 INFO L472 AbstractCegarLoop]: Abstraction has 173 states and 277 transitions. [2018-07-25 13:16:04,451 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:04,452 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 277 transitions. [2018-07-25 13:16:04,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:16:04,452 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:04,452 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:04,453 INFO L415 AbstractCegarLoop]: === Iteration 28 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:04,453 INFO L82 PathProgramCache]: Analyzing trace with hash -86605091, now seen corresponding path program 1 times [2018-07-25 13:16:04,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:04,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:04,468 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:04,469 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:16:04,469 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:04,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:04,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:04,470 INFO L87 Difference]: Start difference. First operand 173 states and 277 transitions. Second operand 7 states. [2018-07-25 13:16:04,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:04,634 INFO L93 Difference]: Finished difference Result 229 states and 357 transitions. [2018-07-25 13:16:04,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:16:04,635 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-07-25 13:16:04,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:04,636 INFO L225 Difference]: With dead ends: 229 [2018-07-25 13:16:04,637 INFO L226 Difference]: Without dead ends: 227 [2018-07-25 13:16:04,637 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:16:04,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-07-25 13:16:04,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 203. [2018-07-25 13:16:04,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-25 13:16:04,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 329 transitions. [2018-07-25 13:16:04,719 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 329 transitions. Word has length 13 [2018-07-25 13:16:04,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:04,719 INFO L472 AbstractCegarLoop]: Abstraction has 203 states and 329 transitions. [2018-07-25 13:16:04,719 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:04,720 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 329 transitions. [2018-07-25 13:16:04,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:16:04,722 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:04,722 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:04,723 INFO L415 AbstractCegarLoop]: === Iteration 29 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:04,723 INFO L82 PathProgramCache]: Analyzing trace with hash -86603521, now seen corresponding path program 1 times [2018-07-25 13:16:04,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:04,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:04,744 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:04,744 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:04,745 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:04,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:04,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:04,746 INFO L87 Difference]: Start difference. First operand 203 states and 329 transitions. Second operand 8 states. [2018-07-25 13:16:04,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:04,996 INFO L93 Difference]: Finished difference Result 254 states and 401 transitions. [2018-07-25 13:16:04,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:16:04,996 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-07-25 13:16:04,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:04,998 INFO L225 Difference]: With dead ends: 254 [2018-07-25 13:16:04,998 INFO L226 Difference]: Without dead ends: 252 [2018-07-25 13:16:04,999 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:16:04,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-07-25 13:16:05,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 206. [2018-07-25 13:16:05,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-07-25 13:16:05,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 334 transitions. [2018-07-25 13:16:05,093 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 334 transitions. Word has length 13 [2018-07-25 13:16:05,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:05,094 INFO L472 AbstractCegarLoop]: Abstraction has 206 states and 334 transitions. [2018-07-25 13:16:05,094 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:05,094 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 334 transitions. [2018-07-25 13:16:05,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:16:05,095 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:05,095 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:05,095 INFO L415 AbstractCegarLoop]: === Iteration 30 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:05,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1761298927, now seen corresponding path program 2 times [2018-07-25 13:16:05,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:05,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:05,115 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:05,116 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:05,116 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:05,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:05,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:05,118 INFO L87 Difference]: Start difference. First operand 206 states and 334 transitions. Second operand 9 states. [2018-07-25 13:16:05,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:05,315 INFO L93 Difference]: Finished difference Result 220 states and 345 transitions. [2018-07-25 13:16:05,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:16:05,316 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-25 13:16:05,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:05,317 INFO L225 Difference]: With dead ends: 220 [2018-07-25 13:16:05,317 INFO L226 Difference]: Without dead ends: 219 [2018-07-25 13:16:05,318 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:16:05,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-07-25 13:16:05,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 203. [2018-07-25 13:16:05,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-25 13:16:05,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 328 transitions. [2018-07-25 13:16:05,397 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 328 transitions. Word has length 13 [2018-07-25 13:16:05,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:05,397 INFO L472 AbstractCegarLoop]: Abstraction has 203 states and 328 transitions. [2018-07-25 13:16:05,397 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:05,398 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 328 transitions. [2018-07-25 13:16:05,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:16:05,398 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:05,398 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:05,399 INFO L415 AbstractCegarLoop]: === Iteration 31 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:05,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1761298639, now seen corresponding path program 2 times [2018-07-25 13:16:05,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:05,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:05,410 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:05,410 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:16:05,410 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:05,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:05,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:05,411 INFO L87 Difference]: Start difference. First operand 203 states and 328 transitions. Second operand 7 states. [2018-07-25 13:16:05,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:05,567 INFO L93 Difference]: Finished difference Result 227 states and 353 transitions. [2018-07-25 13:16:05,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:16:05,568 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-07-25 13:16:05,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:05,569 INFO L225 Difference]: With dead ends: 227 [2018-07-25 13:16:05,569 INFO L226 Difference]: Without dead ends: 225 [2018-07-25 13:16:05,570 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:16:05,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-07-25 13:16:05,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 201. [2018-07-25 13:16:05,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-07-25 13:16:05,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 323 transitions. [2018-07-25 13:16:05,645 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 323 transitions. Word has length 13 [2018-07-25 13:16:05,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:05,645 INFO L472 AbstractCegarLoop]: Abstraction has 201 states and 323 transitions. [2018-07-25 13:16:05,645 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:05,645 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 323 transitions. [2018-07-25 13:16:05,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:16:05,646 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:05,646 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:05,647 INFO L415 AbstractCegarLoop]: === Iteration 32 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:05,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1799471129, now seen corresponding path program 1 times [2018-07-25 13:16:05,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:05,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:05,667 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:05,668 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:05,668 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:05,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:05,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:05,669 INFO L87 Difference]: Start difference. First operand 201 states and 323 transitions. Second operand 9 states. [2018-07-25 13:16:05,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:05,910 INFO L93 Difference]: Finished difference Result 244 states and 382 transitions. [2018-07-25 13:16:05,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:16:05,910 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-25 13:16:05,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:05,911 INFO L225 Difference]: With dead ends: 244 [2018-07-25 13:16:05,912 INFO L226 Difference]: Without dead ends: 242 [2018-07-25 13:16:05,912 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:16:05,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-07-25 13:16:05,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 198. [2018-07-25 13:16:05,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-07-25 13:16:05,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 318 transitions. [2018-07-25 13:16:05,986 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 318 transitions. Word has length 13 [2018-07-25 13:16:05,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:05,986 INFO L472 AbstractCegarLoop]: Abstraction has 198 states and 318 transitions. [2018-07-25 13:16:05,987 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:05,987 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 318 transitions. [2018-07-25 13:16:05,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:16:05,991 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:05,991 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:05,991 INFO L415 AbstractCegarLoop]: === Iteration 33 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:05,991 INFO L82 PathProgramCache]: Analyzing trace with hash 267374077, now seen corresponding path program 1 times [2018-07-25 13:16:05,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:06,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:06,005 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:06,005 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:16:06,005 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:06,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:06,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:06,006 INFO L87 Difference]: Start difference. First operand 198 states and 318 transitions. Second operand 7 states. [2018-07-25 13:16:06,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:06,168 INFO L93 Difference]: Finished difference Result 222 states and 342 transitions. [2018-07-25 13:16:06,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:16:06,168 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-07-25 13:16:06,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:06,170 INFO L225 Difference]: With dead ends: 222 [2018-07-25 13:16:06,170 INFO L226 Difference]: Without dead ends: 220 [2018-07-25 13:16:06,171 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:16:06,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-07-25 13:16:06,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 194. [2018-07-25 13:16:06,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-07-25 13:16:06,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 311 transitions. [2018-07-25 13:16:06,247 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 311 transitions. Word has length 13 [2018-07-25 13:16:06,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:06,247 INFO L472 AbstractCegarLoop]: Abstraction has 194 states and 311 transitions. [2018-07-25 13:16:06,247 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:06,247 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 311 transitions. [2018-07-25 13:16:06,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:16:06,248 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:06,248 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:06,249 INFO L415 AbstractCegarLoop]: === Iteration 34 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:06,249 INFO L82 PathProgramCache]: Analyzing trace with hash 267373789, now seen corresponding path program 1 times [2018-07-25 13:16:06,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:06,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:06,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:06,270 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:06,271 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:06,271 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:06,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:06,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:06,272 INFO L87 Difference]: Start difference. First operand 194 states and 311 transitions. Second operand 9 states. [2018-07-25 13:16:06,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:06,417 INFO L93 Difference]: Finished difference Result 219 states and 343 transitions. [2018-07-25 13:16:06,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:16:06,418 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-25 13:16:06,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:06,419 INFO L225 Difference]: With dead ends: 219 [2018-07-25 13:16:06,419 INFO L226 Difference]: Without dead ends: 218 [2018-07-25 13:16:06,420 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:16:06,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-07-25 13:16:06,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 200. [2018-07-25 13:16:06,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-07-25 13:16:06,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 322 transitions. [2018-07-25 13:16:06,503 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 322 transitions. Word has length 13 [2018-07-25 13:16:06,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:06,503 INFO L472 AbstractCegarLoop]: Abstraction has 200 states and 322 transitions. [2018-07-25 13:16:06,503 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:06,503 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 322 transitions. [2018-07-25 13:16:06,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:16:06,504 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:06,504 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:06,504 INFO L415 AbstractCegarLoop]: === Iteration 35 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:06,505 INFO L82 PathProgramCache]: Analyzing trace with hash 290277111, now seen corresponding path program 1 times [2018-07-25 13:16:06,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:06,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:06,522 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:06,522 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:06,522 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:06,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:06,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:06,523 INFO L87 Difference]: Start difference. First operand 200 states and 322 transitions. Second operand 9 states. [2018-07-25 13:16:06,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:06,752 INFO L93 Difference]: Finished difference Result 251 states and 394 transitions. [2018-07-25 13:16:06,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:16:06,752 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-25 13:16:06,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:06,754 INFO L225 Difference]: With dead ends: 251 [2018-07-25 13:16:06,754 INFO L226 Difference]: Without dead ends: 249 [2018-07-25 13:16:06,755 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:16:06,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-07-25 13:16:06,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 214. [2018-07-25 13:16:06,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-07-25 13:16:06,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 345 transitions. [2018-07-25 13:16:06,839 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 345 transitions. Word has length 13 [2018-07-25 13:16:06,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:06,839 INFO L472 AbstractCegarLoop]: Abstraction has 214 states and 345 transitions. [2018-07-25 13:16:06,839 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:06,840 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 345 transitions. [2018-07-25 13:16:06,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:16:06,840 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:06,840 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:06,841 INFO L415 AbstractCegarLoop]: === Iteration 36 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:06,841 INFO L82 PathProgramCache]: Analyzing trace with hash 2115277807, now seen corresponding path program 2 times [2018-07-25 13:16:06,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:06,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:06,857 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:06,857 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:16:06,858 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:06,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:06,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:06,858 INFO L87 Difference]: Start difference. First operand 214 states and 345 transitions. Second operand 7 states. [2018-07-25 13:16:07,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:07,028 INFO L93 Difference]: Finished difference Result 258 states and 407 transitions. [2018-07-25 13:16:07,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:16:07,028 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-07-25 13:16:07,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:07,030 INFO L225 Difference]: With dead ends: 258 [2018-07-25 13:16:07,030 INFO L226 Difference]: Without dead ends: 256 [2018-07-25 13:16:07,030 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:16:07,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-07-25 13:16:07,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 236. [2018-07-25 13:16:07,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-07-25 13:16:07,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 382 transitions. [2018-07-25 13:16:07,134 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 382 transitions. Word has length 13 [2018-07-25 13:16:07,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:07,134 INFO L472 AbstractCegarLoop]: Abstraction has 236 states and 382 transitions. [2018-07-25 13:16:07,134 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:07,134 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 382 transitions. [2018-07-25 13:16:07,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:16:07,135 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:07,135 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:07,136 INFO L415 AbstractCegarLoop]: === Iteration 37 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:07,136 INFO L82 PathProgramCache]: Analyzing trace with hash 2115277519, now seen corresponding path program 2 times [2018-07-25 13:16:07,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:07,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:07,156 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:07,156 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:07,156 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:07,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:07,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:07,157 INFO L87 Difference]: Start difference. First operand 236 states and 382 transitions. Second operand 9 states. [2018-07-25 13:16:07,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:07,389 INFO L93 Difference]: Finished difference Result 270 states and 424 transitions. [2018-07-25 13:16:07,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:16:07,390 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-25 13:16:07,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:07,391 INFO L225 Difference]: With dead ends: 270 [2018-07-25 13:16:07,392 INFO L226 Difference]: Without dead ends: 269 [2018-07-25 13:16:07,392 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:16:07,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-07-25 13:16:07,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 241. [2018-07-25 13:16:07,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-07-25 13:16:07,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 391 transitions. [2018-07-25 13:16:07,486 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 391 transitions. Word has length 13 [2018-07-25 13:16:07,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:07,486 INFO L472 AbstractCegarLoop]: Abstraction has 241 states and 391 transitions. [2018-07-25 13:16:07,486 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:07,488 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 391 transitions. [2018-07-25 13:16:07,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:16:07,489 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:07,489 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:07,489 INFO L415 AbstractCegarLoop]: === Iteration 38 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:07,489 INFO L82 PathProgramCache]: Analyzing trace with hash 2115278289, now seen corresponding path program 1 times [2018-07-25 13:16:07,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:07,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:07,504 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:07,504 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:07,505 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:07,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:07,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:07,507 INFO L87 Difference]: Start difference. First operand 241 states and 391 transitions. Second operand 8 states. [2018-07-25 13:16:07,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:07,753 INFO L93 Difference]: Finished difference Result 296 states and 468 transitions. [2018-07-25 13:16:07,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:16:07,753 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-07-25 13:16:07,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:07,755 INFO L225 Difference]: With dead ends: 296 [2018-07-25 13:16:07,755 INFO L226 Difference]: Without dead ends: 294 [2018-07-25 13:16:07,756 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:16:07,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-07-25 13:16:07,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 245. [2018-07-25 13:16:07,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-07-25 13:16:07,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 397 transitions. [2018-07-25 13:16:07,881 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 397 transitions. Word has length 13 [2018-07-25 13:16:07,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:07,881 INFO L472 AbstractCegarLoop]: Abstraction has 245 states and 397 transitions. [2018-07-25 13:16:07,881 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:07,882 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 397 transitions. [2018-07-25 13:16:07,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:16:07,882 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:07,882 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:07,883 INFO L415 AbstractCegarLoop]: === Iteration 39 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:07,883 INFO L82 PathProgramCache]: Analyzing trace with hash -238445237, now seen corresponding path program 1 times [2018-07-25 13:16:07,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:07,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:07,911 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:07,911 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:07,911 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:07,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:07,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:07,912 INFO L87 Difference]: Start difference. First operand 245 states and 397 transitions. Second operand 9 states. [2018-07-25 13:16:08,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:08,110 INFO L93 Difference]: Finished difference Result 270 states and 431 transitions. [2018-07-25 13:16:08,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:16:08,110 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-25 13:16:08,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:08,112 INFO L225 Difference]: With dead ends: 270 [2018-07-25 13:16:08,112 INFO L226 Difference]: Without dead ends: 269 [2018-07-25 13:16:08,113 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:16:08,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-07-25 13:16:08,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 260. [2018-07-25 13:16:08,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-07-25 13:16:08,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 423 transitions. [2018-07-25 13:16:08,240 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 423 transitions. Word has length 13 [2018-07-25 13:16:08,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:08,240 INFO L472 AbstractCegarLoop]: Abstraction has 260 states and 423 transitions. [2018-07-25 13:16:08,240 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:08,241 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 423 transitions. [2018-07-25 13:16:08,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:16:08,241 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:08,242 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:08,242 INFO L415 AbstractCegarLoop]: === Iteration 40 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:08,242 INFO L82 PathProgramCache]: Analyzing trace with hash 2129075237, now seen corresponding path program 1 times [2018-07-25 13:16:08,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:08,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:08,262 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:08,262 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:08,262 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:08,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:08,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:08,263 INFO L87 Difference]: Start difference. First operand 260 states and 423 transitions. Second operand 9 states. [2018-07-25 13:16:08,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:08,519 INFO L93 Difference]: Finished difference Result 317 states and 507 transitions. [2018-07-25 13:16:08,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:16:08,519 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-25 13:16:08,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:08,521 INFO L225 Difference]: With dead ends: 317 [2018-07-25 13:16:08,521 INFO L226 Difference]: Without dead ends: 315 [2018-07-25 13:16:08,522 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:16:08,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-07-25 13:16:08,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 252. [2018-07-25 13:16:08,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-07-25 13:16:08,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 411 transitions. [2018-07-25 13:16:08,623 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 411 transitions. Word has length 13 [2018-07-25 13:16:08,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:08,623 INFO L472 AbstractCegarLoop]: Abstraction has 252 states and 411 transitions. [2018-07-25 13:16:08,623 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:08,623 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 411 transitions. [2018-07-25 13:16:08,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:16:08,624 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:08,624 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2018-07-25 13:16:08,624 INFO L415 AbstractCegarLoop]: === Iteration 41 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:08,625 INFO L82 PathProgramCache]: Analyzing trace with hash -24071906, now seen corresponding path program 1 times [2018-07-25 13:16:08,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:08,639 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:08,639 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:08,639 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:08,640 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:08,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:08,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:08,640 INFO L87 Difference]: Start difference. First operand 252 states and 411 transitions. Second operand 9 states. [2018-07-25 13:16:08,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:08,867 INFO L93 Difference]: Finished difference Result 317 states and 513 transitions. [2018-07-25 13:16:08,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 13:16:08,867 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-25 13:16:08,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:08,869 INFO L225 Difference]: With dead ends: 317 [2018-07-25 13:16:08,869 INFO L226 Difference]: Without dead ends: 315 [2018-07-25 13:16:08,870 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:16:08,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-07-25 13:16:08,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 258. [2018-07-25 13:16:08,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-07-25 13:16:08,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 423 transitions. [2018-07-25 13:16:08,984 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 423 transitions. Word has length 13 [2018-07-25 13:16:08,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:08,984 INFO L472 AbstractCegarLoop]: Abstraction has 258 states and 423 transitions. [2018-07-25 13:16:08,984 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:08,984 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 423 transitions. [2018-07-25 13:16:08,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:08,985 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:08,985 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:08,985 INFO L415 AbstractCegarLoop]: === Iteration 42 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:08,986 INFO L82 PathProgramCache]: Analyzing trace with hash -603538094, now seen corresponding path program 1 times [2018-07-25 13:16:08,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:09,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:09,011 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:09,011 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:16:09,012 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:16:09,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:16:09,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:16:09,012 INFO L87 Difference]: Start difference. First operand 258 states and 423 transitions. Second operand 11 states. [2018-07-25 13:16:09,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:09,233 INFO L93 Difference]: Finished difference Result 273 states and 437 transitions. [2018-07-25 13:16:09,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:16:09,233 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-25 13:16:09,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:09,235 INFO L225 Difference]: With dead ends: 273 [2018-07-25 13:16:09,235 INFO L226 Difference]: Without dead ends: 272 [2018-07-25 13:16:09,236 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:16:09,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-07-25 13:16:09,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 249. [2018-07-25 13:16:09,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-07-25 13:16:09,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 408 transitions. [2018-07-25 13:16:09,363 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 408 transitions. Word has length 15 [2018-07-25 13:16:09,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:09,364 INFO L472 AbstractCegarLoop]: Abstraction has 249 states and 408 transitions. [2018-07-25 13:16:09,364 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:16:09,364 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 408 transitions. [2018-07-25 13:16:09,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:09,365 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:09,365 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:09,365 INFO L415 AbstractCegarLoop]: === Iteration 43 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:09,365 INFO L82 PathProgramCache]: Analyzing trace with hash 2021827592, now seen corresponding path program 1 times [2018-07-25 13:16:09,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:09,384 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:09,384 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:09,384 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:16:09,384 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:16:09,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:16:09,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:16:09,385 INFO L87 Difference]: Start difference. First operand 249 states and 408 transitions. Second operand 11 states. [2018-07-25 13:16:09,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:09,604 INFO L93 Difference]: Finished difference Result 279 states and 448 transitions. [2018-07-25 13:16:09,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:16:09,605 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-25 13:16:09,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:09,606 INFO L225 Difference]: With dead ends: 279 [2018-07-25 13:16:09,606 INFO L226 Difference]: Without dead ends: 278 [2018-07-25 13:16:09,607 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:16:09,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-07-25 13:16:09,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 255. [2018-07-25 13:16:09,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-07-25 13:16:09,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 418 transitions. [2018-07-25 13:16:09,743 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 418 transitions. Word has length 15 [2018-07-25 13:16:09,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:09,744 INFO L472 AbstractCegarLoop]: Abstraction has 255 states and 418 transitions. [2018-07-25 13:16:09,744 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:16:09,744 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 418 transitions. [2018-07-25 13:16:09,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:09,745 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:09,745 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:09,745 INFO L415 AbstractCegarLoop]: === Iteration 44 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:09,747 INFO L82 PathProgramCache]: Analyzing trace with hash 2013238847, now seen corresponding path program 1 times [2018-07-25 13:16:09,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:09,760 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:09,761 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:09,761 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:09,761 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:09,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:09,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:09,762 INFO L87 Difference]: Start difference. First operand 255 states and 418 transitions. Second operand 9 states. [2018-07-25 13:16:09,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:09,994 INFO L93 Difference]: Finished difference Result 296 states and 483 transitions. [2018-07-25 13:16:09,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 13:16:09,995 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-07-25 13:16:09,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:09,996 INFO L225 Difference]: With dead ends: 296 [2018-07-25 13:16:09,997 INFO L226 Difference]: Without dead ends: 295 [2018-07-25 13:16:09,997 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:16:09,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-07-25 13:16:10,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 246. [2018-07-25 13:16:10,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-07-25 13:16:10,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 403 transitions. [2018-07-25 13:16:10,119 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 403 transitions. Word has length 15 [2018-07-25 13:16:10,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:10,120 INFO L472 AbstractCegarLoop]: Abstraction has 246 states and 403 transitions. [2018-07-25 13:16:10,120 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:10,120 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 403 transitions. [2018-07-25 13:16:10,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:10,121 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:10,121 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:10,121 INFO L415 AbstractCegarLoop]: === Iteration 45 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:10,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1215990847, now seen corresponding path program 1 times [2018-07-25 13:16:10,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:10,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:10,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:10,142 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:10,142 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:16:10,143 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:16:10,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:16:10,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:16:10,143 INFO L87 Difference]: Start difference. First operand 246 states and 403 transitions. Second operand 11 states. [2018-07-25 13:16:10,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:10,350 INFO L93 Difference]: Finished difference Result 274 states and 449 transitions. [2018-07-25 13:16:10,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:16:10,351 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-25 13:16:10,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:10,352 INFO L225 Difference]: With dead ends: 274 [2018-07-25 13:16:10,352 INFO L226 Difference]: Without dead ends: 273 [2018-07-25 13:16:10,353 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:16:10,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-07-25 13:16:10,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 267. [2018-07-25 13:16:10,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-07-25 13:16:10,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 438 transitions. [2018-07-25 13:16:10,478 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 438 transitions. Word has length 15 [2018-07-25 13:16:10,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:10,479 INFO L472 AbstractCegarLoop]: Abstraction has 267 states and 438 transitions. [2018-07-25 13:16:10,479 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:16:10,479 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 438 transitions. [2018-07-25 13:16:10,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:10,480 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:10,481 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:10,481 INFO L415 AbstractCegarLoop]: === Iteration 46 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:10,481 INFO L82 PathProgramCache]: Analyzing trace with hash -994782852, now seen corresponding path program 1 times [2018-07-25 13:16:10,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:10,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:10,510 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:10,510 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:16:10,511 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:16:10,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:16:10,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:16:10,511 INFO L87 Difference]: Start difference. First operand 267 states and 438 transitions. Second operand 11 states. [2018-07-25 13:16:10,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:10,796 INFO L93 Difference]: Finished difference Result 311 states and 496 transitions. [2018-07-25 13:16:10,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:16:10,796 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-25 13:16:10,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:10,798 INFO L225 Difference]: With dead ends: 311 [2018-07-25 13:16:10,798 INFO L226 Difference]: Without dead ends: 309 [2018-07-25 13:16:10,799 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:16:10,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-07-25 13:16:10,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 279. [2018-07-25 13:16:10,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-07-25 13:16:10,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 457 transitions. [2018-07-25 13:16:10,929 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 457 transitions. Word has length 15 [2018-07-25 13:16:10,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:10,929 INFO L472 AbstractCegarLoop]: Abstraction has 279 states and 457 transitions. [2018-07-25 13:16:10,929 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:16:10,929 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 457 transitions. [2018-07-25 13:16:10,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:10,930 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:10,930 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:10,931 INFO L415 AbstractCegarLoop]: === Iteration 47 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:10,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1087577094, now seen corresponding path program 2 times [2018-07-25 13:16:10,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:10,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:10,953 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:10,953 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:16:10,953 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:16:10,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:16:10,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:16:10,954 INFO L87 Difference]: Start difference. First operand 279 states and 457 transitions. Second operand 12 states. [2018-07-25 13:16:11,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:11,280 INFO L93 Difference]: Finished difference Result 313 states and 495 transitions. [2018-07-25 13:16:11,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 13:16:11,280 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2018-07-25 13:16:11,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:11,283 INFO L225 Difference]: With dead ends: 313 [2018-07-25 13:16:11,283 INFO L226 Difference]: Without dead ends: 312 [2018-07-25 13:16:11,284 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:16:11,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-07-25 13:16:11,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 284. [2018-07-25 13:16:11,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-07-25 13:16:11,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 466 transitions. [2018-07-25 13:16:11,454 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 466 transitions. Word has length 15 [2018-07-25 13:16:11,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:11,454 INFO L472 AbstractCegarLoop]: Abstraction has 284 states and 466 transitions. [2018-07-25 13:16:11,454 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:16:11,455 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 466 transitions. [2018-07-25 13:16:11,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:11,455 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:11,456 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:11,456 INFO L415 AbstractCegarLoop]: === Iteration 48 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:11,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1086284228, now seen corresponding path program 1 times [2018-07-25 13:16:11,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:11,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:11,481 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:11,482 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:16:11,482 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:16:11,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:16:11,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:16:11,483 INFO L87 Difference]: Start difference. First operand 284 states and 466 transitions. Second operand 11 states. [2018-07-25 13:16:11,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:11,911 INFO L93 Difference]: Finished difference Result 354 states and 563 transitions. [2018-07-25 13:16:11,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 13:16:11,912 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-25 13:16:11,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:11,914 INFO L225 Difference]: With dead ends: 354 [2018-07-25 13:16:11,914 INFO L226 Difference]: Without dead ends: 352 [2018-07-25 13:16:11,915 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=169, Invalid=823, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:16:11,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-07-25 13:16:12,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 296. [2018-07-25 13:16:12,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-07-25 13:16:12,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 486 transitions. [2018-07-25 13:16:12,077 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 486 transitions. Word has length 15 [2018-07-25 13:16:12,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:12,077 INFO L472 AbstractCegarLoop]: Abstraction has 296 states and 486 transitions. [2018-07-25 13:16:12,077 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:16:12,077 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 486 transitions. [2018-07-25 13:16:12,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:12,078 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:12,078 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:12,078 INFO L415 AbstractCegarLoop]: === Iteration 49 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:12,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1365577631, now seen corresponding path program 1 times [2018-07-25 13:16:12,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:12,096 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:12,096 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:12,096 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:16:12,096 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:16:12,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:16:12,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:16:12,097 INFO L87 Difference]: Start difference. First operand 296 states and 486 transitions. Second operand 11 states. [2018-07-25 13:16:12,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:12,338 INFO L93 Difference]: Finished difference Result 332 states and 544 transitions. [2018-07-25 13:16:12,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:16:12,339 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-25 13:16:12,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:12,341 INFO L225 Difference]: With dead ends: 332 [2018-07-25 13:16:12,341 INFO L226 Difference]: Without dead ends: 331 [2018-07-25 13:16:12,341 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:16:12,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-07-25 13:16:12,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 318. [2018-07-25 13:16:12,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-07-25 13:16:12,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 523 transitions. [2018-07-25 13:16:12,497 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 523 transitions. Word has length 15 [2018-07-25 13:16:12,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:12,498 INFO L472 AbstractCegarLoop]: Abstraction has 318 states and 523 transitions. [2018-07-25 13:16:12,498 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:16:12,498 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 523 transitions. [2018-07-25 13:16:12,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:12,499 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:12,499 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:12,499 INFO L415 AbstractCegarLoop]: === Iteration 50 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:12,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1365577919, now seen corresponding path program 1 times [2018-07-25 13:16:12,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:12,514 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:12,514 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:12,514 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:16:12,515 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:16:12,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:16:12,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:12,515 INFO L87 Difference]: Start difference. First operand 318 states and 523 transitions. Second operand 10 states. [2018-07-25 13:16:13,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:13,032 INFO L93 Difference]: Finished difference Result 503 states and 808 transitions. [2018-07-25 13:16:13,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:16:13,032 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 13:16:13,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:13,035 INFO L225 Difference]: With dead ends: 503 [2018-07-25 13:16:13,035 INFO L226 Difference]: Without dead ends: 501 [2018-07-25 13:16:13,036 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:16:13,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-07-25 13:16:13,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 396. [2018-07-25 13:16:13,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-07-25 13:16:13,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 658 transitions. [2018-07-25 13:16:13,216 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 658 transitions. Word has length 15 [2018-07-25 13:16:13,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:13,216 INFO L472 AbstractCegarLoop]: Abstraction has 396 states and 658 transitions. [2018-07-25 13:16:13,216 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:16:13,216 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 658 transitions. [2018-07-25 13:16:13,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:13,217 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:13,217 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:13,218 INFO L415 AbstractCegarLoop]: === Iteration 51 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:13,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1374166088, now seen corresponding path program 1 times [2018-07-25 13:16:13,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:13,238 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:13,238 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:13,238 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:16:13,239 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:16:13,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:16:13,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:16:13,239 INFO L87 Difference]: Start difference. First operand 396 states and 658 transitions. Second operand 12 states. [2018-07-25 13:16:13,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:13,642 INFO L93 Difference]: Finished difference Result 489 states and 800 transitions. [2018-07-25 13:16:13,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:16:13,642 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2018-07-25 13:16:13,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:13,645 INFO L225 Difference]: With dead ends: 489 [2018-07-25 13:16:13,645 INFO L226 Difference]: Without dead ends: 488 [2018-07-25 13:16:13,645 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:16:13,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-07-25 13:16:13,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 429. [2018-07-25 13:16:13,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-07-25 13:16:13,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 718 transitions. [2018-07-25 13:16:13,858 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 718 transitions. Word has length 15 [2018-07-25 13:16:13,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:13,858 INFO L472 AbstractCegarLoop]: Abstraction has 429 states and 718 transitions. [2018-07-25 13:16:13,858 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:16:13,858 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 718 transitions. [2018-07-25 13:16:13,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:13,859 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:13,859 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:13,860 INFO L415 AbstractCegarLoop]: === Iteration 52 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:13,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1374164806, now seen corresponding path program 1 times [2018-07-25 13:16:13,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:13,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:13,886 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:13,887 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:16:13,887 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:16:13,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:16:13,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:16:13,888 INFO L87 Difference]: Start difference. First operand 429 states and 718 transitions. Second operand 11 states. [2018-07-25 13:16:14,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:14,299 INFO L93 Difference]: Finished difference Result 484 states and 793 transitions. [2018-07-25 13:16:14,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:16:14,300 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-25 13:16:14,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:14,302 INFO L225 Difference]: With dead ends: 484 [2018-07-25 13:16:14,302 INFO L226 Difference]: Without dead ends: 482 [2018-07-25 13:16:14,303 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:16:14,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2018-07-25 13:16:14,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 442. [2018-07-25 13:16:14,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-07-25 13:16:14,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 739 transitions. [2018-07-25 13:16:14,540 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 739 transitions. Word has length 15 [2018-07-25 13:16:14,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:14,541 INFO L472 AbstractCegarLoop]: Abstraction has 442 states and 739 transitions. [2018-07-25 13:16:14,541 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:16:14,541 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 739 transitions. [2018-07-25 13:16:14,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:14,542 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:14,542 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:14,542 INFO L415 AbstractCegarLoop]: === Iteration 53 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:14,542 INFO L82 PathProgramCache]: Analyzing trace with hash -750529310, now seen corresponding path program 1 times [2018-07-25 13:16:14,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:14,570 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:14,570 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:14,570 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:16:14,570 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:16:14,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:16:14,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:14,571 INFO L87 Difference]: Start difference. First operand 442 states and 739 transitions. Second operand 10 states. [2018-07-25 13:16:14,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:14,884 INFO L93 Difference]: Finished difference Result 465 states and 766 transitions. [2018-07-25 13:16:14,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:16:14,885 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 13:16:14,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:14,887 INFO L225 Difference]: With dead ends: 465 [2018-07-25 13:16:14,887 INFO L226 Difference]: Without dead ends: 464 [2018-07-25 13:16:14,888 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:16:14,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-07-25 13:16:15,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 451. [2018-07-25 13:16:15,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-07-25 13:16:15,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 754 transitions. [2018-07-25 13:16:15,099 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 754 transitions. Word has length 15 [2018-07-25 13:16:15,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:15,099 INFO L472 AbstractCegarLoop]: Abstraction has 451 states and 754 transitions. [2018-07-25 13:16:15,099 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:16:15,099 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 754 transitions. [2018-07-25 13:16:15,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:15,100 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:15,101 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:15,101 INFO L415 AbstractCegarLoop]: === Iteration 54 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:15,101 INFO L82 PathProgramCache]: Analyzing trace with hash -215212996, now seen corresponding path program 1 times [2018-07-25 13:16:15,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:15,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:15,121 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:15,122 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:16:15,122 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:16:15,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:16:15,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:15,123 INFO L87 Difference]: Start difference. First operand 451 states and 754 transitions. Second operand 10 states. [2018-07-25 13:16:15,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:15,507 INFO L93 Difference]: Finished difference Result 518 states and 855 transitions. [2018-07-25 13:16:15,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 13:16:15,507 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 13:16:15,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:15,510 INFO L225 Difference]: With dead ends: 518 [2018-07-25 13:16:15,510 INFO L226 Difference]: Without dead ends: 516 [2018-07-25 13:16:15,511 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:16:15,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-07-25 13:16:15,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 467. [2018-07-25 13:16:15,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-07-25 13:16:15,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 781 transitions. [2018-07-25 13:16:15,728 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 781 transitions. Word has length 15 [2018-07-25 13:16:15,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:15,728 INFO L472 AbstractCegarLoop]: Abstraction has 467 states and 781 transitions. [2018-07-25 13:16:15,728 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:16:15,728 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 781 transitions. [2018-07-25 13:16:15,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:15,729 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:15,730 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:15,730 INFO L415 AbstractCegarLoop]: === Iteration 55 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:15,730 INFO L82 PathProgramCache]: Analyzing trace with hash -494290335, now seen corresponding path program 1 times [2018-07-25 13:16:15,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:15,745 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:15,745 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:15,745 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:15,745 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:16:15,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:16:15,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:15,746 INFO L87 Difference]: Start difference. First operand 467 states and 781 transitions. Second operand 10 states. [2018-07-25 13:16:16,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:16,071 INFO L93 Difference]: Finished difference Result 513 states and 856 transitions. [2018-07-25 13:16:16,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:16:16,071 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 13:16:16,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:16,074 INFO L225 Difference]: With dead ends: 513 [2018-07-25 13:16:16,074 INFO L226 Difference]: Without dead ends: 512 [2018-07-25 13:16:16,074 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:16:16,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-07-25 13:16:16,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 492. [2018-07-25 13:16:16,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-07-25 13:16:16,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 823 transitions. [2018-07-25 13:16:16,324 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 823 transitions. Word has length 15 [2018-07-25 13:16:16,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:16,324 INFO L472 AbstractCegarLoop]: Abstraction has 492 states and 823 transitions. [2018-07-25 13:16:16,324 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:16:16,325 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 823 transitions. [2018-07-25 13:16:16,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:16,326 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:16,326 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:16,326 INFO L415 AbstractCegarLoop]: === Iteration 56 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:16,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1511388970, now seen corresponding path program 2 times [2018-07-25 13:16:16,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:16,341 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:16,341 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:16,341 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:16:16,342 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:16:16,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:16:16,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:16:16,342 INFO L87 Difference]: Start difference. First operand 492 states and 823 transitions. Second operand 11 states. [2018-07-25 13:16:16,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:16,773 INFO L93 Difference]: Finished difference Result 571 states and 939 transitions. [2018-07-25 13:16:16,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:16:16,774 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-25 13:16:16,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:16,777 INFO L225 Difference]: With dead ends: 571 [2018-07-25 13:16:16,777 INFO L226 Difference]: Without dead ends: 570 [2018-07-25 13:16:16,778 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:16:16,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-07-25 13:16:17,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 512. [2018-07-25 13:16:17,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2018-07-25 13:16:17,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 860 transitions. [2018-07-25 13:16:17,055 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 860 transitions. Word has length 15 [2018-07-25 13:16:17,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:17,056 INFO L472 AbstractCegarLoop]: Abstraction has 512 states and 860 transitions. [2018-07-25 13:16:17,056 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:16:17,056 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 860 transitions. [2018-07-25 13:16:17,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:17,057 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:17,057 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:17,057 INFO L415 AbstractCegarLoop]: === Iteration 57 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:17,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1511389740, now seen corresponding path program 1 times [2018-07-25 13:16:17,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:17,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:17,076 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:17,076 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:16:17,076 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:16:17,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:16:17,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:17,077 INFO L87 Difference]: Start difference. First operand 512 states and 860 transitions. Second operand 10 states. [2018-07-25 13:16:17,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:17,513 INFO L93 Difference]: Finished difference Result 583 states and 963 transitions. [2018-07-25 13:16:17,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 13:16:17,514 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 13:16:17,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:17,517 INFO L225 Difference]: With dead ends: 583 [2018-07-25 13:16:17,517 INFO L226 Difference]: Without dead ends: 581 [2018-07-25 13:16:17,518 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:16:17,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2018-07-25 13:16:17,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 524. [2018-07-25 13:16:17,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-07-25 13:16:17,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 881 transitions. [2018-07-25 13:16:17,756 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 881 transitions. Word has length 15 [2018-07-25 13:16:17,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:17,756 INFO L472 AbstractCegarLoop]: Abstraction has 524 states and 881 transitions. [2018-07-25 13:16:17,756 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:16:17,756 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 881 transitions. [2018-07-25 13:16:17,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:17,757 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:17,757 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:17,757 INFO L415 AbstractCegarLoop]: === Iteration 58 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:17,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1502800801, now seen corresponding path program 1 times [2018-07-25 13:16:17,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:17,778 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:17,778 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:17,778 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:16:17,778 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:16:17,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:16:17,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:16:17,779 INFO L87 Difference]: Start difference. First operand 524 states and 881 transitions. Second operand 11 states. [2018-07-25 13:16:18,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:18,381 INFO L93 Difference]: Finished difference Result 737 states and 1215 transitions. [2018-07-25 13:16:18,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:16:18,382 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-25 13:16:18,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:18,386 INFO L225 Difference]: With dead ends: 737 [2018-07-25 13:16:18,386 INFO L226 Difference]: Without dead ends: 736 [2018-07-25 13:16:18,387 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:16:18,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2018-07-25 13:16:18,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 623. [2018-07-25 13:16:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2018-07-25 13:16:18,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 1052 transitions. [2018-07-25 13:16:18,766 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 1052 transitions. Word has length 15 [2018-07-25 13:16:18,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:18,766 INFO L472 AbstractCegarLoop]: Abstraction has 623 states and 1052 transitions. [2018-07-25 13:16:18,766 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:16:18,767 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 1052 transitions. [2018-07-25 13:16:18,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:18,768 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:18,768 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-25 13:16:18,768 INFO L415 AbstractCegarLoop]: === Iteration 59 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:18,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1502802083, now seen corresponding path program 1 times [2018-07-25 13:16:18,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:18,779 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:18,779 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:18,779 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:18,779 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:18,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:18,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:18,780 INFO L87 Difference]: Start difference. First operand 623 states and 1052 transitions. Second operand 9 states. [2018-07-25 13:16:19,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:19,353 INFO L93 Difference]: Finished difference Result 819 states and 1364 transitions. [2018-07-25 13:16:19,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:16:19,354 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-07-25 13:16:19,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:19,358 INFO L225 Difference]: With dead ends: 819 [2018-07-25 13:16:19,358 INFO L226 Difference]: Without dead ends: 817 [2018-07-25 13:16:19,359 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:16:19,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2018-07-25 13:16:19,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 600. [2018-07-25 13:16:19,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-07-25 13:16:19,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 1013 transitions. [2018-07-25 13:16:19,684 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 1013 transitions. Word has length 15 [2018-07-25 13:16:19,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:19,684 INFO L472 AbstractCegarLoop]: Abstraction has 600 states and 1013 transitions. [2018-07-25 13:16:19,684 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:19,684 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 1013 transitions. [2018-07-25 13:16:19,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:19,685 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:19,685 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:19,686 INFO L415 AbstractCegarLoop]: === Iteration 60 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:19,686 INFO L82 PathProgramCache]: Analyzing trace with hash -708989572, now seen corresponding path program 1 times [2018-07-25 13:16:19,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:19,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:19,701 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:19,701 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:16:19,702 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:16:19,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:16:19,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:16:19,702 INFO L87 Difference]: Start difference. First operand 600 states and 1013 transitions. Second operand 11 states. [2018-07-25 13:16:20,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:20,127 INFO L93 Difference]: Finished difference Result 638 states and 1059 transitions. [2018-07-25 13:16:20,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:16:20,128 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-25 13:16:20,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:20,131 INFO L225 Difference]: With dead ends: 638 [2018-07-25 13:16:20,132 INFO L226 Difference]: Without dead ends: 637 [2018-07-25 13:16:20,132 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:16:20,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2018-07-25 13:16:20,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 587. [2018-07-25 13:16:20,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-07-25 13:16:20,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 989 transitions. [2018-07-25 13:16:20,457 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 989 transitions. Word has length 15 [2018-07-25 13:16:20,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:20,457 INFO L472 AbstractCegarLoop]: Abstraction has 587 states and 989 transitions. [2018-07-25 13:16:20,457 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:16:20,457 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 989 transitions. [2018-07-25 13:16:20,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:20,459 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:20,459 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:20,459 INFO L415 AbstractCegarLoop]: === Iteration 61 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:20,459 INFO L82 PathProgramCache]: Analyzing trace with hash -708189250, now seen corresponding path program 1 times [2018-07-25 13:16:20,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:20,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:20,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:20,474 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:20,474 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:16:20,475 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:16:20,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:16:20,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:20,475 INFO L87 Difference]: Start difference. First operand 587 states and 989 transitions. Second operand 10 states. [2018-07-25 13:16:20,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:20,914 INFO L93 Difference]: Finished difference Result 642 states and 1067 transitions. [2018-07-25 13:16:20,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:16:20,914 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 13:16:20,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:20,918 INFO L225 Difference]: With dead ends: 642 [2018-07-25 13:16:20,918 INFO L226 Difference]: Without dead ends: 640 [2018-07-25 13:16:20,919 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:16:20,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-07-25 13:16:21,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 587. [2018-07-25 13:16:21,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-07-25 13:16:21,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 989 transitions. [2018-07-25 13:16:21,249 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 989 transitions. Word has length 15 [2018-07-25 13:16:21,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:21,249 INFO L472 AbstractCegarLoop]: Abstraction has 587 states and 989 transitions. [2018-07-25 13:16:21,249 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:16:21,250 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 989 transitions. [2018-07-25 13:16:21,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:21,251 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:21,251 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:21,251 INFO L415 AbstractCegarLoop]: === Iteration 62 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:21,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1511308848, now seen corresponding path program 2 times [2018-07-25 13:16:21,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:21,270 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:21,271 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:21,271 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:16:21,272 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:16:21,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:16:21,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:21,272 INFO L87 Difference]: Start difference. First operand 587 states and 989 transitions. Second operand 10 states. [2018-07-25 13:16:21,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:21,668 INFO L93 Difference]: Finished difference Result 610 states and 1020 transitions. [2018-07-25 13:16:21,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:16:21,668 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 13:16:21,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:21,671 INFO L225 Difference]: With dead ends: 610 [2018-07-25 13:16:21,672 INFO L226 Difference]: Without dead ends: 609 [2018-07-25 13:16:21,672 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:16:21,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2018-07-25 13:16:21,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 578. [2018-07-25 13:16:21,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-07-25 13:16:21,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 974 transitions. [2018-07-25 13:16:21,986 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 974 transitions. Word has length 15 [2018-07-25 13:16:21,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:21,986 INFO L472 AbstractCegarLoop]: Abstraction has 578 states and 974 transitions. [2018-07-25 13:16:21,987 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:16:21,987 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 974 transitions. [2018-07-25 13:16:21,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:21,988 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:21,988 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:21,988 INFO L415 AbstractCegarLoop]: === Iteration 63 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:21,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1638227434, now seen corresponding path program 1 times [2018-07-25 13:16:21,989 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:22,006 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:22,007 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:22,007 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:16:22,007 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:16:22,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:16:22,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:16:22,008 INFO L87 Difference]: Start difference. First operand 578 states and 974 transitions. Second operand 11 states. [2018-07-25 13:16:22,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:22,390 INFO L93 Difference]: Finished difference Result 633 states and 1050 transitions. [2018-07-25 13:16:22,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:16:22,390 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-25 13:16:22,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:22,393 INFO L225 Difference]: With dead ends: 633 [2018-07-25 13:16:22,393 INFO L226 Difference]: Without dead ends: 631 [2018-07-25 13:16:22,394 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:16:22,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2018-07-25 13:16:22,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 591. [2018-07-25 13:16:22,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2018-07-25 13:16:22,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 995 transitions. [2018-07-25 13:16:22,697 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 995 transitions. Word has length 15 [2018-07-25 13:16:22,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:22,698 INFO L472 AbstractCegarLoop]: Abstraction has 591 states and 995 transitions. [2018-07-25 13:16:22,698 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:16:22,698 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 995 transitions. [2018-07-25 13:16:22,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:22,699 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:22,699 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:22,699 INFO L415 AbstractCegarLoop]: === Iteration 64 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:22,700 INFO L82 PathProgramCache]: Analyzing trace with hash 553313350, now seen corresponding path program 1 times [2018-07-25 13:16:22,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:22,713 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:22,714 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:22,715 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:16:22,715 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:16:22,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:16:22,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:16:22,716 INFO L87 Difference]: Start difference. First operand 591 states and 995 transitions. Second operand 11 states. [2018-07-25 13:16:23,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:23,132 INFO L93 Difference]: Finished difference Result 620 states and 1034 transitions. [2018-07-25 13:16:23,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:16:23,133 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-25 13:16:23,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:23,137 INFO L225 Difference]: With dead ends: 620 [2018-07-25 13:16:23,137 INFO L226 Difference]: Without dead ends: 619 [2018-07-25 13:16:23,137 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:16:23,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-07-25 13:16:23,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 596. [2018-07-25 13:16:23,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2018-07-25 13:16:23,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1004 transitions. [2018-07-25 13:16:23,520 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1004 transitions. Word has length 15 [2018-07-25 13:16:23,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:23,520 INFO L472 AbstractCegarLoop]: Abstraction has 596 states and 1004 transitions. [2018-07-25 13:16:23,520 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:16:23,520 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1004 transitions. [2018-07-25 13:16:23,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:16:23,522 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:23,522 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1] [2018-07-25 13:16:23,523 INFO L415 AbstractCegarLoop]: === Iteration 65 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:23,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1657460349, now seen corresponding path program 1 times [2018-07-25 13:16:23,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:23,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:23,546 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:23,546 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:23,546 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:16:23,546 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:16:23,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:16:23,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:16:23,547 INFO L87 Difference]: Start difference. First operand 596 states and 1004 transitions. Second operand 11 states. [2018-07-25 13:16:23,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:23,942 INFO L93 Difference]: Finished difference Result 601 states and 1009 transitions. [2018-07-25 13:16:23,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:16:23,942 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-25 13:16:23,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:23,945 INFO L225 Difference]: With dead ends: 601 [2018-07-25 13:16:23,945 INFO L226 Difference]: Without dead ends: 599 [2018-07-25 13:16:23,946 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:16:23,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-07-25 13:16:24,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 590. [2018-07-25 13:16:24,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-07-25 13:16:24,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 994 transitions. [2018-07-25 13:16:24,224 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 994 transitions. Word has length 15 [2018-07-25 13:16:24,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:24,224 INFO L472 AbstractCegarLoop]: Abstraction has 590 states and 994 transitions. [2018-07-25 13:16:24,224 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:16:24,224 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 994 transitions. [2018-07-25 13:16:24,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:16:24,225 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:24,225 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:24,226 INFO L415 AbstractCegarLoop]: === Iteration 66 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:24,226 INFO L82 PathProgramCache]: Analyzing trace with hash -616146153, now seen corresponding path program 3 times [2018-07-25 13:16:24,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:24,234 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:24,235 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:24,235 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:24,235 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:24,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:24,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:24,236 INFO L87 Difference]: Start difference. First operand 590 states and 994 transitions. Second operand 8 states. [2018-07-25 13:16:24,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:24,649 INFO L93 Difference]: Finished difference Result 652 states and 1080 transitions. [2018-07-25 13:16:24,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:16:24,649 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 13:16:24,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:24,654 INFO L225 Difference]: With dead ends: 652 [2018-07-25 13:16:24,654 INFO L226 Difference]: Without dead ends: 650 [2018-07-25 13:16:24,655 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:16:24,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-07-25 13:16:24,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 534. [2018-07-25 13:16:24,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2018-07-25 13:16:24,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 901 transitions. [2018-07-25 13:16:24,960 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 901 transitions. Word has length 16 [2018-07-25 13:16:24,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:24,960 INFO L472 AbstractCegarLoop]: Abstraction has 534 states and 901 transitions. [2018-07-25 13:16:24,960 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:24,960 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 901 transitions. [2018-07-25 13:16:24,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:16:24,961 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:24,961 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:24,961 INFO L415 AbstractCegarLoop]: === Iteration 67 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:24,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1231757577, now seen corresponding path program 4 times [2018-07-25 13:16:24,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:24,970 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:24,970 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:24,971 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:24,971 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:24,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:24,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:24,971 INFO L87 Difference]: Start difference. First operand 534 states and 901 transitions. Second operand 8 states. [2018-07-25 13:16:25,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:25,319 INFO L93 Difference]: Finished difference Result 587 states and 970 transitions. [2018-07-25 13:16:25,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:16:25,319 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 13:16:25,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:25,323 INFO L225 Difference]: With dead ends: 587 [2018-07-25 13:16:25,323 INFO L226 Difference]: Without dead ends: 585 [2018-07-25 13:16:25,324 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:16:25,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-07-25 13:16:25,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 518. [2018-07-25 13:16:25,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-07-25 13:16:25,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 872 transitions. [2018-07-25 13:16:25,608 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 872 transitions. Word has length 16 [2018-07-25 13:16:25,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:25,608 INFO L472 AbstractCegarLoop]: Abstraction has 518 states and 872 transitions. [2018-07-25 13:16:25,608 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:25,609 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 872 transitions. [2018-07-25 13:16:25,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:16:25,610 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:25,612 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:25,612 INFO L415 AbstractCegarLoop]: === Iteration 68 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:25,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1223170690, now seen corresponding path program 1 times [2018-07-25 13:16:25,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:25,643 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:25,644 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:25,645 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:25,645 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:25,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:25,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:25,646 INFO L87 Difference]: Start difference. First operand 518 states and 872 transitions. Second operand 8 states. [2018-07-25 13:16:26,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:26,034 INFO L93 Difference]: Finished difference Result 599 states and 990 transitions. [2018-07-25 13:16:26,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:16:26,034 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 13:16:26,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:26,037 INFO L225 Difference]: With dead ends: 599 [2018-07-25 13:16:26,037 INFO L226 Difference]: Without dead ends: 597 [2018-07-25 13:16:26,038 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:16:26,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-07-25 13:16:26,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 523. [2018-07-25 13:16:26,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-07-25 13:16:26,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 880 transitions. [2018-07-25 13:16:26,281 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 880 transitions. Word has length 16 [2018-07-25 13:16:26,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:26,281 INFO L472 AbstractCegarLoop]: Abstraction has 523 states and 880 transitions. [2018-07-25 13:16:26,281 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:26,281 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 880 transitions. [2018-07-25 13:16:26,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:16:26,282 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:26,282 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:26,282 INFO L415 AbstractCegarLoop]: === Iteration 69 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:26,283 INFO L82 PathProgramCache]: Analyzing trace with hash -767609008, now seen corresponding path program 2 times [2018-07-25 13:16:26,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:26,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:26,289 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:26,289 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:26,289 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:26,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:26,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:26,290 INFO L87 Difference]: Start difference. First operand 523 states and 880 transitions. Second operand 8 states. [2018-07-25 13:16:26,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:26,714 INFO L93 Difference]: Finished difference Result 581 states and 960 transitions. [2018-07-25 13:16:26,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:16:26,714 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 13:16:26,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:26,717 INFO L225 Difference]: With dead ends: 581 [2018-07-25 13:16:26,719 INFO L226 Difference]: Without dead ends: 579 [2018-07-25 13:16:26,719 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:16:26,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-07-25 13:16:26,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 518. [2018-07-25 13:16:26,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-07-25 13:16:26,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 872 transitions. [2018-07-25 13:16:26,937 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 872 transitions. Word has length 16 [2018-07-25 13:16:26,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:26,937 INFO L472 AbstractCegarLoop]: Abstraction has 518 states and 872 transitions. [2018-07-25 13:16:26,938 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:26,938 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 872 transitions. [2018-07-25 13:16:26,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:16:26,939 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:26,939 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:26,939 INFO L415 AbstractCegarLoop]: === Iteration 70 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:26,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1823106549, now seen corresponding path program 1 times [2018-07-25 13:16:26,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:26,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:26,948 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:26,949 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:26,949 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:26,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:26,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:26,949 INFO L87 Difference]: Start difference. First operand 518 states and 872 transitions. Second operand 8 states. [2018-07-25 13:16:27,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:27,314 INFO L93 Difference]: Finished difference Result 575 states and 954 transitions. [2018-07-25 13:16:27,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:16:27,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 13:16:27,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:27,319 INFO L225 Difference]: With dead ends: 575 [2018-07-25 13:16:27,319 INFO L226 Difference]: Without dead ends: 573 [2018-07-25 13:16:27,319 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:16:27,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2018-07-25 13:16:27,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 521. [2018-07-25 13:16:27,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-07-25 13:16:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 877 transitions. [2018-07-25 13:16:27,547 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 877 transitions. Word has length 16 [2018-07-25 13:16:27,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:27,547 INFO L472 AbstractCegarLoop]: Abstraction has 521 states and 877 transitions. [2018-07-25 13:16:27,547 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:27,547 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 877 transitions. [2018-07-25 13:16:27,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:16:27,548 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:27,548 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:27,548 INFO L415 AbstractCegarLoop]: === Iteration 71 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:27,548 INFO L82 PathProgramCache]: Analyzing trace with hash 481081049, now seen corresponding path program 2 times [2018-07-25 13:16:27,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:27,556 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:27,557 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:27,557 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:27,557 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:27,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:27,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:27,558 INFO L87 Difference]: Start difference. First operand 521 states and 877 transitions. Second operand 8 states. [2018-07-25 13:16:27,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:27,904 INFO L93 Difference]: Finished difference Result 581 states and 961 transitions. [2018-07-25 13:16:27,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:16:27,904 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 13:16:27,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:27,906 INFO L225 Difference]: With dead ends: 581 [2018-07-25 13:16:27,906 INFO L226 Difference]: Without dead ends: 579 [2018-07-25 13:16:27,907 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:16:27,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-07-25 13:16:28,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 518. [2018-07-25 13:16:28,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-07-25 13:16:28,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 872 transitions. [2018-07-25 13:16:28,122 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 872 transitions. Word has length 16 [2018-07-25 13:16:28,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:28,123 INFO L472 AbstractCegarLoop]: Abstraction has 518 states and 872 transitions. [2018-07-25 13:16:28,123 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:28,123 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 872 transitions. [2018-07-25 13:16:28,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:16:28,123 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:28,124 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:28,124 INFO L415 AbstractCegarLoop]: === Iteration 72 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:28,124 INFO L82 PathProgramCache]: Analyzing trace with hash 472492110, now seen corresponding path program 3 times [2018-07-25 13:16:28,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:28,136 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:28,137 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:28,137 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:28,137 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:28,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:28,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:28,138 INFO L87 Difference]: Start difference. First operand 518 states and 872 transitions. Second operand 8 states. [2018-07-25 13:16:28,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:28,486 INFO L93 Difference]: Finished difference Result 573 states and 946 transitions. [2018-07-25 13:16:28,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:16:28,486 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 13:16:28,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:28,489 INFO L225 Difference]: With dead ends: 573 [2018-07-25 13:16:28,489 INFO L226 Difference]: Without dead ends: 571 [2018-07-25 13:16:28,490 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:16:28,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2018-07-25 13:16:28,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 512. [2018-07-25 13:16:28,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2018-07-25 13:16:28,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 862 transitions. [2018-07-25 13:16:28,742 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 862 transitions. Word has length 16 [2018-07-25 13:16:28,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:28,742 INFO L472 AbstractCegarLoop]: Abstraction has 512 states and 862 transitions. [2018-07-25 13:16:28,742 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:28,742 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 862 transitions. [2018-07-25 13:16:28,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:16:28,743 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:28,743 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:28,743 INFO L415 AbstractCegarLoop]: === Iteration 73 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:28,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1974571456, now seen corresponding path program 4 times [2018-07-25 13:16:28,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:28,750 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:28,751 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:28,751 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:28,751 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:28,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:28,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:28,752 INFO L87 Difference]: Start difference. First operand 512 states and 862 transitions. Second operand 8 states. [2018-07-25 13:16:29,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:29,110 INFO L93 Difference]: Finished difference Result 564 states and 935 transitions. [2018-07-25 13:16:29,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:16:29,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 13:16:29,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:29,113 INFO L225 Difference]: With dead ends: 564 [2018-07-25 13:16:29,113 INFO L226 Difference]: Without dead ends: 562 [2018-07-25 13:16:29,114 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:16:29,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2018-07-25 13:16:29,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 452. [2018-07-25 13:16:29,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-07-25 13:16:29,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 761 transitions. [2018-07-25 13:16:29,316 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 761 transitions. Word has length 16 [2018-07-25 13:16:29,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:29,316 INFO L472 AbstractCegarLoop]: Abstraction has 452 states and 761 transitions. [2018-07-25 13:16:29,316 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:29,316 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 761 transitions. [2018-07-25 13:16:29,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 13:16:29,317 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:29,317 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:29,317 INFO L415 AbstractCegarLoop]: === Iteration 74 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:29,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1651842093, now seen corresponding path program 1 times [2018-07-25 13:16:29,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:29,336 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:29,336 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:29,336 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:16:29,337 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:16:29,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:16:29,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:16:29,337 INFO L87 Difference]: Start difference. First operand 452 states and 761 transitions. Second operand 13 states. [2018-07-25 13:16:29,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:29,641 INFO L93 Difference]: Finished difference Result 480 states and 791 transitions. [2018-07-25 13:16:29,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 13:16:29,641 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2018-07-25 13:16:29,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:29,643 INFO L225 Difference]: With dead ends: 480 [2018-07-25 13:16:29,643 INFO L226 Difference]: Without dead ends: 479 [2018-07-25 13:16:29,643 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=195, Invalid=861, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:16:29,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-07-25 13:16:29,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 430. [2018-07-25 13:16:29,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-07-25 13:16:29,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 722 transitions. [2018-07-25 13:16:29,849 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 722 transitions. Word has length 17 [2018-07-25 13:16:29,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:29,849 INFO L472 AbstractCegarLoop]: Abstraction has 430 states and 722 transitions. [2018-07-25 13:16:29,849 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:16:29,850 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 722 transitions. [2018-07-25 13:16:29,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 13:16:29,850 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:29,850 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:29,850 INFO L415 AbstractCegarLoop]: === Iteration 75 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:29,851 INFO L82 PathProgramCache]: Analyzing trace with hash 692781, now seen corresponding path program 1 times [2018-07-25 13:16:29,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:29,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:29,868 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:29,868 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:16:29,868 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:16:29,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:16:29,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:16:29,869 INFO L87 Difference]: Start difference. First operand 430 states and 722 transitions. Second operand 12 states. [2018-07-25 13:16:30,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:30,227 INFO L93 Difference]: Finished difference Result 545 states and 906 transitions. [2018-07-25 13:16:30,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:16:30,228 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-07-25 13:16:30,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:30,230 INFO L225 Difference]: With dead ends: 545 [2018-07-25 13:16:30,230 INFO L226 Difference]: Without dead ends: 544 [2018-07-25 13:16:30,230 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:16:30,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-07-25 13:16:30,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 451. [2018-07-25 13:16:30,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-07-25 13:16:30,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 757 transitions. [2018-07-25 13:16:30,453 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 757 transitions. Word has length 17 [2018-07-25 13:16:30,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:30,453 INFO L472 AbstractCegarLoop]: Abstraction has 451 states and 757 transitions. [2018-07-25 13:16:30,453 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:16:30,453 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 757 transitions. [2018-07-25 13:16:30,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 13:16:30,454 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:30,454 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:30,454 INFO L415 AbstractCegarLoop]: === Iteration 76 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:30,454 INFO L82 PathProgramCache]: Analyzing trace with hash 337396676, now seen corresponding path program 1 times [2018-07-25 13:16:30,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:30,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:30,467 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:30,467 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:16:30,467 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:16:30,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:16:30,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:16:30,468 INFO L87 Difference]: Start difference. First operand 451 states and 757 transitions. Second operand 12 states. [2018-07-25 13:16:30,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:30,740 INFO L93 Difference]: Finished difference Result 458 states and 767 transitions. [2018-07-25 13:16:30,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:16:30,740 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-07-25 13:16:30,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:30,741 INFO L225 Difference]: With dead ends: 458 [2018-07-25 13:16:30,741 INFO L226 Difference]: Without dead ends: 457 [2018-07-25 13:16:30,742 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:16:30,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-07-25 13:16:30,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 423. [2018-07-25 13:16:30,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-07-25 13:16:30,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 709 transitions. [2018-07-25 13:16:30,954 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 709 transitions. Word has length 17 [2018-07-25 13:16:30,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:30,954 INFO L472 AbstractCegarLoop]: Abstraction has 423 states and 709 transitions. [2018-07-25 13:16:30,954 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:16:30,954 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 709 transitions. [2018-07-25 13:16:30,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 13:16:30,955 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:30,955 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:30,956 INFO L415 AbstractCegarLoop]: === Iteration 77 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:30,956 INFO L82 PathProgramCache]: Analyzing trace with hash -449446913, now seen corresponding path program 2 times [2018-07-25 13:16:30,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:30,975 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:30,975 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:30,975 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:16:30,975 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:16:30,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:16:30,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:16:30,976 INFO L87 Difference]: Start difference. First operand 423 states and 709 transitions. Second operand 13 states. [2018-07-25 13:16:31,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:31,401 INFO L93 Difference]: Finished difference Result 508 states and 829 transitions. [2018-07-25 13:16:31,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 13:16:31,401 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2018-07-25 13:16:31,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:31,403 INFO L225 Difference]: With dead ends: 508 [2018-07-25 13:16:31,403 INFO L226 Difference]: Without dead ends: 507 [2018-07-25 13:16:31,403 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=220, Invalid=1112, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:16:31,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-07-25 13:16:31,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 440. [2018-07-25 13:16:31,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-07-25 13:16:31,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 736 transitions. [2018-07-25 13:16:31,641 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 736 transitions. Word has length 17 [2018-07-25 13:16:31,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:31,642 INFO L472 AbstractCegarLoop]: Abstraction has 440 states and 736 transitions. [2018-07-25 13:16:31,642 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:16:31,642 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 736 transitions. [2018-07-25 13:16:31,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 13:16:31,643 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:31,643 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1] [2018-07-25 13:16:31,643 INFO L415 AbstractCegarLoop]: === Iteration 78 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:31,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1940633158, now seen corresponding path program 1 times [2018-07-25 13:16:31,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:31,673 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:31,673 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:31,673 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:16:31,673 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:16:31,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:16:31,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:16:31,674 INFO L87 Difference]: Start difference. First operand 440 states and 736 transitions. Second operand 13 states. [2018-07-25 13:16:32,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:32,008 INFO L93 Difference]: Finished difference Result 446 states and 743 transitions. [2018-07-25 13:16:32,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:16:32,008 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2018-07-25 13:16:32,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:32,009 INFO L225 Difference]: With dead ends: 446 [2018-07-25 13:16:32,009 INFO L226 Difference]: Without dead ends: 445 [2018-07-25 13:16:32,009 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:16:32,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-07-25 13:16:32,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 424. [2018-07-25 13:16:32,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-07-25 13:16:32,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 709 transitions. [2018-07-25 13:16:32,217 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 709 transitions. Word has length 17 [2018-07-25 13:16:32,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:32,218 INFO L472 AbstractCegarLoop]: Abstraction has 424 states and 709 transitions. [2018-07-25 13:16:32,218 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:16:32,218 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 709 transitions. [2018-07-25 13:16:32,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 13:16:32,219 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:32,219 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:32,219 INFO L415 AbstractCegarLoop]: === Iteration 79 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:32,220 INFO L82 PathProgramCache]: Analyzing trace with hash -453832993, now seen corresponding path program 1 times [2018-07-25 13:16:32,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:32,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:32,239 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:32,240 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:32,240 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:16:32,240 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:16:32,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:16:32,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:16:32,241 INFO L87 Difference]: Start difference. First operand 424 states and 709 transitions. Second operand 12 states. [2018-07-25 13:16:32,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:32,730 INFO L93 Difference]: Finished difference Result 505 states and 821 transitions. [2018-07-25 13:16:32,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 13:16:32,730 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-07-25 13:16:32,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:32,732 INFO L225 Difference]: With dead ends: 505 [2018-07-25 13:16:32,732 INFO L226 Difference]: Without dead ends: 504 [2018-07-25 13:16:32,732 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:16:32,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2018-07-25 13:16:32,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 453. [2018-07-25 13:16:32,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2018-07-25 13:16:32,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 755 transitions. [2018-07-25 13:16:32,973 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 755 transitions. Word has length 17 [2018-07-25 13:16:32,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:32,973 INFO L472 AbstractCegarLoop]: Abstraction has 453 states and 755 transitions. [2018-07-25 13:16:32,973 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:16:32,973 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 755 transitions. [2018-07-25 13:16:32,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 13:16:32,974 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:32,974 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:32,974 INFO L415 AbstractCegarLoop]: === Iteration 80 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:32,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1757610527, now seen corresponding path program 1 times [2018-07-25 13:16:32,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:32,989 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:32,990 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:32,990 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:16:32,990 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:16:32,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:16:32,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:16:32,991 INFO L87 Difference]: Start difference. First operand 453 states and 755 transitions. Second operand 12 states. [2018-07-25 13:16:33,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:33,420 INFO L93 Difference]: Finished difference Result 516 states and 838 transitions. [2018-07-25 13:16:33,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 13:16:33,421 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-07-25 13:16:33,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:33,422 INFO L225 Difference]: With dead ends: 516 [2018-07-25 13:16:33,422 INFO L226 Difference]: Without dead ends: 515 [2018-07-25 13:16:33,423 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=169, Invalid=887, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:16:33,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-07-25 13:16:33,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 449. [2018-07-25 13:16:33,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-07-25 13:16:33,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 748 transitions. [2018-07-25 13:16:33,656 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 748 transitions. Word has length 17 [2018-07-25 13:16:33,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:33,656 INFO L472 AbstractCegarLoop]: Abstraction has 449 states and 748 transitions. [2018-07-25 13:16:33,656 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:16:33,656 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 748 transitions. [2018-07-25 13:16:33,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 13:16:33,657 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:33,657 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:33,657 INFO L415 AbstractCegarLoop]: === Iteration 81 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:33,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1709007603, now seen corresponding path program 1 times [2018-07-25 13:16:33,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:33,675 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:33,676 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:33,676 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:16:33,676 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:16:33,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:16:33,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:16:33,677 INFO L87 Difference]: Start difference. First operand 449 states and 748 transitions. Second operand 13 states. [2018-07-25 13:16:34,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:34,065 INFO L93 Difference]: Finished difference Result 526 states and 863 transitions. [2018-07-25 13:16:34,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:16:34,065 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2018-07-25 13:16:34,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:34,066 INFO L225 Difference]: With dead ends: 526 [2018-07-25 13:16:34,066 INFO L226 Difference]: Without dead ends: 524 [2018-07-25 13:16:34,066 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:16:34,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-07-25 13:16:34,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 455. [2018-07-25 13:16:34,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-07-25 13:16:34,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 760 transitions. [2018-07-25 13:16:34,325 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 760 transitions. Word has length 17 [2018-07-25 13:16:34,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:34,325 INFO L472 AbstractCegarLoop]: Abstraction has 455 states and 760 transitions. [2018-07-25 13:16:34,325 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:16:34,325 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 760 transitions. [2018-07-25 13:16:34,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 13:16:34,326 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:34,326 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:34,326 INFO L415 AbstractCegarLoop]: === Iteration 82 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:34,326 INFO L82 PathProgramCache]: Analyzing trace with hash -840518133, now seen corresponding path program 2 times [2018-07-25 13:16:34,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:34,339 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:34,339 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:34,340 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:16:34,340 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:16:34,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:16:34,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:16:34,340 INFO L87 Difference]: Start difference. First operand 455 states and 760 transitions. Second operand 12 states. [2018-07-25 13:16:34,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:34,688 INFO L93 Difference]: Finished difference Result 499 states and 825 transitions. [2018-07-25 13:16:34,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:16:34,688 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-07-25 13:16:34,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:34,689 INFO L225 Difference]: With dead ends: 499 [2018-07-25 13:16:34,689 INFO L226 Difference]: Without dead ends: 498 [2018-07-25 13:16:34,689 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:16:34,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-07-25 13:16:34,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 428. [2018-07-25 13:16:34,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-07-25 13:16:34,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 713 transitions. [2018-07-25 13:16:34,946 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 713 transitions. Word has length 17 [2018-07-25 13:16:34,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:34,946 INFO L472 AbstractCegarLoop]: Abstraction has 428 states and 713 transitions. [2018-07-25 13:16:34,946 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:16:34,946 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 713 transitions. [2018-07-25 13:16:34,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:16:34,946 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:34,947 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:34,947 INFO L415 AbstractCegarLoop]: === Iteration 83 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:34,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1270158156, now seen corresponding path program 1 times [2018-07-25 13:16:34,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:34,956 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:34,957 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:34,957 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:16:34,957 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:16:34,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:16:34,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:16:34,957 INFO L87 Difference]: Start difference. First operand 428 states and 713 transitions. Second operand 12 states. [2018-07-25 13:16:35,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:35,274 INFO L93 Difference]: Finished difference Result 491 states and 812 transitions. [2018-07-25 13:16:35,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:16:35,274 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-07-25 13:16:35,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:35,275 INFO L225 Difference]: With dead ends: 491 [2018-07-25 13:16:35,275 INFO L226 Difference]: Without dead ends: 490 [2018-07-25 13:16:35,276 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:16:35,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-07-25 13:16:35,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 466. [2018-07-25 13:16:35,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-07-25 13:16:35,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 779 transitions. [2018-07-25 13:16:35,528 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 779 transitions. Word has length 18 [2018-07-25 13:16:35,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:35,528 INFO L472 AbstractCegarLoop]: Abstraction has 466 states and 779 transitions. [2018-07-25 13:16:35,528 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:16:35,529 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 779 transitions. [2018-07-25 13:16:35,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:16:35,529 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:35,529 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:35,529 INFO L415 AbstractCegarLoop]: === Iteration 84 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:35,529 INFO L82 PathProgramCache]: Analyzing trace with hash -301522250, now seen corresponding path program 1 times [2018-07-25 13:16:35,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:35,539 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:35,540 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:35,540 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:16:35,540 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:16:35,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:16:35,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:16:35,540 INFO L87 Difference]: Start difference. First operand 466 states and 779 transitions. Second operand 12 states. [2018-07-25 13:16:35,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:35,993 INFO L93 Difference]: Finished difference Result 563 states and 925 transitions. [2018-07-25 13:16:35,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:16:35,993 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-07-25 13:16:35,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:35,994 INFO L225 Difference]: With dead ends: 563 [2018-07-25 13:16:35,994 INFO L226 Difference]: Without dead ends: 561 [2018-07-25 13:16:35,995 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:16:35,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-07-25 13:16:36,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 458. [2018-07-25 13:16:36,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-07-25 13:16:36,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 765 transitions. [2018-07-25 13:16:36,249 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 765 transitions. Word has length 18 [2018-07-25 13:16:36,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:36,250 INFO L472 AbstractCegarLoop]: Abstraction has 458 states and 765 transitions. [2018-07-25 13:16:36,250 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:16:36,250 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 765 transitions. [2018-07-25 13:16:36,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:16:36,250 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:36,251 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:36,251 INFO L415 AbstractCegarLoop]: === Iteration 85 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:36,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1503466215, now seen corresponding path program 1 times [2018-07-25 13:16:36,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:36,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:36,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:36,265 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:36,265 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:16:36,265 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:16:36,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:16:36,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:16:36,266 INFO L87 Difference]: Start difference. First operand 458 states and 765 transitions. Second operand 11 states. [2018-07-25 13:16:36,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:36,812 INFO L93 Difference]: Finished difference Result 513 states and 833 transitions. [2018-07-25 13:16:36,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 13:16:36,812 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-25 13:16:36,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:36,813 INFO L225 Difference]: With dead ends: 513 [2018-07-25 13:16:36,813 INFO L226 Difference]: Without dead ends: 511 [2018-07-25 13:16:36,813 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=188, Invalid=682, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:16:36,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-07-25 13:16:37,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 459. [2018-07-25 13:16:37,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-07-25 13:16:37,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 767 transitions. [2018-07-25 13:16:37,083 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 767 transitions. Word has length 18 [2018-07-25 13:16:37,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:37,083 INFO L472 AbstractCegarLoop]: Abstraction has 459 states and 767 transitions. [2018-07-25 13:16:37,083 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:16:37,083 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 767 transitions. [2018-07-25 13:16:37,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:16:37,084 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:37,084 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:37,085 INFO L415 AbstractCegarLoop]: === Iteration 86 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:37,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1224172812, now seen corresponding path program 2 times [2018-07-25 13:16:37,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:37,102 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:37,103 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:37,103 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:16:37,103 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:16:37,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:16:37,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:16:37,104 INFO L87 Difference]: Start difference. First operand 459 states and 767 transitions. Second operand 13 states. [2018-07-25 13:16:37,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:37,524 INFO L93 Difference]: Finished difference Result 507 states and 835 transitions. [2018-07-25 13:16:37,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:16:37,524 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-07-25 13:16:37,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:37,525 INFO L225 Difference]: With dead ends: 507 [2018-07-25 13:16:37,525 INFO L226 Difference]: Without dead ends: 506 [2018-07-25 13:16:37,525 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:16:37,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-07-25 13:16:37,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 466. [2018-07-25 13:16:37,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-07-25 13:16:37,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 780 transitions. [2018-07-25 13:16:37,799 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 780 transitions. Word has length 18 [2018-07-25 13:16:37,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:37,799 INFO L472 AbstractCegarLoop]: Abstraction has 466 states and 780 transitions. [2018-07-25 13:16:37,799 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:16:37,799 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 780 transitions. [2018-07-25 13:16:37,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:16:37,800 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:37,800 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:37,800 INFO L415 AbstractCegarLoop]: === Iteration 87 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:37,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1224172524, now seen corresponding path program 1 times [2018-07-25 13:16:37,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:37,810 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:37,811 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:37,811 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:16:37,811 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:16:37,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:16:37,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:16:37,812 INFO L87 Difference]: Start difference. First operand 466 states and 780 transitions. Second operand 11 states. [2018-07-25 13:16:38,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:38,272 INFO L93 Difference]: Finished difference Result 518 states and 845 transitions. [2018-07-25 13:16:38,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:16:38,272 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-25 13:16:38,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:38,273 INFO L225 Difference]: With dead ends: 518 [2018-07-25 13:16:38,273 INFO L226 Difference]: Without dead ends: 516 [2018-07-25 13:16:38,274 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:16:38,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-07-25 13:16:38,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 469. [2018-07-25 13:16:38,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-07-25 13:16:38,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 783 transitions. [2018-07-25 13:16:38,601 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 783 transitions. Word has length 18 [2018-07-25 13:16:38,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:38,601 INFO L472 AbstractCegarLoop]: Abstraction has 469 states and 783 transitions. [2018-07-25 13:16:38,601 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:16:38,601 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 783 transitions. [2018-07-25 13:16:38,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:16:38,602 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:38,602 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:38,602 INFO L415 AbstractCegarLoop]: === Iteration 88 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:38,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1215585637, now seen corresponding path program 1 times [2018-07-25 13:16:38,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:38,614 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:38,614 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:38,615 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:16:38,615 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:16:38,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:16:38,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:16:38,615 INFO L87 Difference]: Start difference. First operand 469 states and 783 transitions. Second operand 11 states. [2018-07-25 13:16:39,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:39,025 INFO L93 Difference]: Finished difference Result 531 states and 868 transitions. [2018-07-25 13:16:39,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:16:39,026 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-25 13:16:39,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:39,027 INFO L225 Difference]: With dead ends: 531 [2018-07-25 13:16:39,027 INFO L226 Difference]: Without dead ends: 529 [2018-07-25 13:16:39,027 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:16:39,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-07-25 13:16:39,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 470. [2018-07-25 13:16:39,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-07-25 13:16:39,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 785 transitions. [2018-07-25 13:16:39,358 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 785 transitions. Word has length 18 [2018-07-25 13:16:39,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:39,358 INFO L472 AbstractCegarLoop]: Abstraction has 470 states and 785 transitions. [2018-07-25 13:16:39,359 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:16:39,359 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 785 transitions. [2018-07-25 13:16:39,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:16:39,359 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:39,359 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:39,359 INFO L415 AbstractCegarLoop]: === Iteration 89 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:39,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1085218294, now seen corresponding path program 1 times [2018-07-25 13:16:39,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:39,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:39,373 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:39,374 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:16:39,374 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:16:39,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:16:39,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:16:39,374 INFO L87 Difference]: Start difference. First operand 470 states and 785 transitions. Second operand 12 states. [2018-07-25 13:16:39,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:39,808 INFO L93 Difference]: Finished difference Result 545 states and 895 transitions. [2018-07-25 13:16:39,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:16:39,808 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-07-25 13:16:39,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:39,809 INFO L225 Difference]: With dead ends: 545 [2018-07-25 13:16:39,810 INFO L226 Difference]: Without dead ends: 543 [2018-07-25 13:16:39,810 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:16:39,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-07-25 13:16:40,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 474. [2018-07-25 13:16:40,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2018-07-25 13:16:40,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 791 transitions. [2018-07-25 13:16:40,290 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 791 transitions. Word has length 18 [2018-07-25 13:16:40,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:40,291 INFO L472 AbstractCegarLoop]: Abstraction has 474 states and 791 transitions. [2018-07-25 13:16:40,291 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:16:40,291 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 791 transitions. [2018-07-25 13:16:40,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:16:40,291 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:40,292 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:40,292 INFO L415 AbstractCegarLoop]: === Iteration 90 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:40,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1467012, now seen corresponding path program 1 times [2018-07-25 13:16:40,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:40,305 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:40,305 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:40,305 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:16:40,305 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:16:40,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:16:40,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:16:40,306 INFO L87 Difference]: Start difference. First operand 474 states and 791 transitions. Second operand 11 states. [2018-07-25 13:16:40,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:40,825 INFO L93 Difference]: Finished difference Result 634 states and 1037 transitions. [2018-07-25 13:16:40,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:16:40,825 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-25 13:16:40,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:40,827 INFO L225 Difference]: With dead ends: 634 [2018-07-25 13:16:40,827 INFO L226 Difference]: Without dead ends: 632 [2018-07-25 13:16:40,828 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:16:40,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-07-25 13:16:41,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 493. [2018-07-25 13:16:41,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-07-25 13:16:41,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 822 transitions. [2018-07-25 13:16:41,232 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 822 transitions. Word has length 18 [2018-07-25 13:16:41,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:41,233 INFO L472 AbstractCegarLoop]: Abstraction has 493 states and 822 transitions. [2018-07-25 13:16:41,233 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:16:41,233 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 822 transitions. [2018-07-25 13:16:41,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:16:41,233 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:41,233 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:41,234 INFO L415 AbstractCegarLoop]: === Iteration 91 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:41,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1846437006, now seen corresponding path program 1 times [2018-07-25 13:16:41,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:41,247 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:41,248 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:41,248 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:16:41,248 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:16:41,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:16:41,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:16:41,249 INFO L87 Difference]: Start difference. First operand 493 states and 822 transitions. Second operand 13 states. [2018-07-25 13:16:41,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:41,780 INFO L93 Difference]: Finished difference Result 574 states and 939 transitions. [2018-07-25 13:16:41,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:16:41,780 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-07-25 13:16:41,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:41,782 INFO L225 Difference]: With dead ends: 574 [2018-07-25 13:16:41,782 INFO L226 Difference]: Without dead ends: 573 [2018-07-25 13:16:41,782 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:16:41,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2018-07-25 13:16:42,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 491. [2018-07-25 13:16:42,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2018-07-25 13:16:42,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 817 transitions. [2018-07-25 13:16:42,170 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 817 transitions. Word has length 18 [2018-07-25 13:16:42,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:42,170 INFO L472 AbstractCegarLoop]: Abstraction has 491 states and 817 transitions. [2018-07-25 13:16:42,170 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:16:42,170 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 817 transitions. [2018-07-25 13:16:42,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:16:42,171 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:42,171 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:42,171 INFO L415 AbstractCegarLoop]: === Iteration 92 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:42,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1846436718, now seen corresponding path program 2 times [2018-07-25 13:16:42,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:42,184 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:42,184 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:42,185 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:16:42,185 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:16:42,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:16:42,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:16:42,185 INFO L87 Difference]: Start difference. First operand 491 states and 817 transitions. Second operand 11 states. [2018-07-25 13:16:42,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:42,648 INFO L93 Difference]: Finished difference Result 557 states and 901 transitions. [2018-07-25 13:16:42,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:16:42,649 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-25 13:16:42,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:42,650 INFO L225 Difference]: With dead ends: 557 [2018-07-25 13:16:42,650 INFO L226 Difference]: Without dead ends: 555 [2018-07-25 13:16:42,650 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:16:42,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-07-25 13:16:42,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 477. [2018-07-25 13:16:42,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-07-25 13:16:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 791 transitions. [2018-07-25 13:16:42,941 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 791 transitions. Word has length 18 [2018-07-25 13:16:42,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:42,941 INFO L472 AbstractCegarLoop]: Abstraction has 477 states and 791 transitions. [2018-07-25 13:16:42,941 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:16:42,941 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 791 transitions. [2018-07-25 13:16:42,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:16:42,942 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:42,942 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:42,942 INFO L415 AbstractCegarLoop]: === Iteration 93 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:42,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1837849831, now seen corresponding path program 1 times [2018-07-25 13:16:42,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:42,954 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:42,954 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:42,954 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:16:42,954 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:16:42,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:16:42,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:16:42,955 INFO L87 Difference]: Start difference. First operand 477 states and 791 transitions. Second operand 11 states. [2018-07-25 13:16:43,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:43,436 INFO L93 Difference]: Finished difference Result 557 states and 903 transitions. [2018-07-25 13:16:43,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:16:43,436 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-25 13:16:43,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:43,438 INFO L225 Difference]: With dead ends: 557 [2018-07-25 13:16:43,438 INFO L226 Difference]: Without dead ends: 555 [2018-07-25 13:16:43,438 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:16:43,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-07-25 13:16:43,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 467. [2018-07-25 13:16:43,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-07-25 13:16:43,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 775 transitions. [2018-07-25 13:16:43,911 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 775 transitions. Word has length 18 [2018-07-25 13:16:43,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:43,911 INFO L472 AbstractCegarLoop]: Abstraction has 467 states and 775 transitions. [2018-07-25 13:16:43,911 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:16:43,911 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 775 transitions. [2018-07-25 13:16:43,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:16:43,912 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:43,912 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:43,912 INFO L415 AbstractCegarLoop]: === Iteration 94 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:43,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1884609208, now seen corresponding path program 1 times [2018-07-25 13:16:43,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:43,924 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:43,924 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:43,924 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:16:43,924 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:16:43,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:16:43,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:16:43,925 INFO L87 Difference]: Start difference. First operand 467 states and 775 transitions. Second operand 12 states. [2018-07-25 13:16:44,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:44,428 INFO L93 Difference]: Finished difference Result 594 states and 971 transitions. [2018-07-25 13:16:44,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:16:44,428 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-07-25 13:16:44,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:44,429 INFO L225 Difference]: With dead ends: 594 [2018-07-25 13:16:44,429 INFO L226 Difference]: Without dead ends: 592 [2018-07-25 13:16:44,430 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:16:44,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-07-25 13:16:44,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 469. [2018-07-25 13:16:44,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-07-25 13:16:44,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 778 transitions. [2018-07-25 13:16:44,722 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 778 transitions. Word has length 18 [2018-07-25 13:16:44,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:44,722 INFO L472 AbstractCegarLoop]: Abstraction has 469 states and 778 transitions. [2018-07-25 13:16:44,722 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:16:44,722 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 778 transitions. [2018-07-25 13:16:44,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:16:44,723 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:44,723 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:44,723 INFO L415 AbstractCegarLoop]: === Iteration 95 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:44,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1136854538, now seen corresponding path program 1 times [2018-07-25 13:16:44,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:44,733 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:44,733 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:44,733 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:16:44,733 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:16:44,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:16:44,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:44,734 INFO L87 Difference]: Start difference. First operand 469 states and 778 transitions. Second operand 10 states. [2018-07-25 13:16:45,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:45,162 INFO L93 Difference]: Finished difference Result 531 states and 864 transitions. [2018-07-25 13:16:45,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:16:45,163 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-25 13:16:45,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:45,163 INFO L225 Difference]: With dead ends: 531 [2018-07-25 13:16:45,163 INFO L226 Difference]: Without dead ends: 529 [2018-07-25 13:16:45,164 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:16:45,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-07-25 13:16:45,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 473. [2018-07-25 13:16:45,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-07-25 13:16:45,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 785 transitions. [2018-07-25 13:16:45,490 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 785 transitions. Word has length 18 [2018-07-25 13:16:45,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:45,490 INFO L472 AbstractCegarLoop]: Abstraction has 473 states and 785 transitions. [2018-07-25 13:16:45,491 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:16:45,491 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 785 transitions. [2018-07-25 13:16:45,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:16:45,491 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:45,491 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:45,492 INFO L415 AbstractCegarLoop]: === Iteration 96 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:45,492 INFO L82 PathProgramCache]: Analyzing trace with hash 589748198, now seen corresponding path program 1 times [2018-07-25 13:16:45,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:45,505 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:45,505 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:45,505 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:16:45,506 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:16:45,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:16:45,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:45,506 INFO L87 Difference]: Start difference. First operand 473 states and 785 transitions. Second operand 10 states. [2018-07-25 13:16:45,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:45,998 INFO L93 Difference]: Finished difference Result 578 states and 943 transitions. [2018-07-25 13:16:45,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:16:45,998 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-25 13:16:45,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:45,999 INFO L225 Difference]: With dead ends: 578 [2018-07-25 13:16:45,999 INFO L226 Difference]: Without dead ends: 576 [2018-07-25 13:16:45,999 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:16:46,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-07-25 13:16:46,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 496. [2018-07-25 13:16:46,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-07-25 13:16:46,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 824 transitions. [2018-07-25 13:16:46,314 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 824 transitions. Word has length 18 [2018-07-25 13:16:46,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:46,314 INFO L472 AbstractCegarLoop]: Abstraction has 496 states and 824 transitions. [2018-07-25 13:16:46,315 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:16:46,315 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 824 transitions. [2018-07-25 13:16:46,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:16:46,315 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:46,316 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:46,316 INFO L415 AbstractCegarLoop]: === Iteration 97 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:46,316 INFO L82 PathProgramCache]: Analyzing trace with hash 581159259, now seen corresponding path program 1 times [2018-07-25 13:16:46,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:46,327 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:46,327 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:46,327 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:46,327 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:46,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:46,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:46,328 INFO L87 Difference]: Start difference. First operand 496 states and 824 transitions. Second operand 9 states. [2018-07-25 13:16:46,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:46,762 INFO L93 Difference]: Finished difference Result 551 states and 898 transitions. [2018-07-25 13:16:46,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 13:16:46,762 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-07-25 13:16:46,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:46,763 INFO L225 Difference]: With dead ends: 551 [2018-07-25 13:16:46,763 INFO L226 Difference]: Without dead ends: 549 [2018-07-25 13:16:46,763 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:16:46,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2018-07-25 13:16:47,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 500. [2018-07-25 13:16:47,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2018-07-25 13:16:47,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 828 transitions. [2018-07-25 13:16:47,082 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 828 transitions. Word has length 18 [2018-07-25 13:16:47,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:47,082 INFO L472 AbstractCegarLoop]: Abstraction has 500 states and 828 transitions. [2018-07-25 13:16:47,082 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:47,082 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 828 transitions. [2018-07-25 13:16:47,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:16:47,083 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:47,083 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:47,083 INFO L415 AbstractCegarLoop]: === Iteration 98 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:47,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1629830792, now seen corresponding path program 1 times [2018-07-25 13:16:47,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:47,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:47,095 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:47,095 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:16:47,095 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:16:47,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:16:47,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:47,095 INFO L87 Difference]: Start difference. First operand 500 states and 828 transitions. Second operand 10 states. [2018-07-25 13:16:47,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:47,564 INFO L93 Difference]: Finished difference Result 581 states and 944 transitions. [2018-07-25 13:16:47,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:16:47,565 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-25 13:16:47,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:47,565 INFO L225 Difference]: With dead ends: 581 [2018-07-25 13:16:47,565 INFO L226 Difference]: Without dead ends: 579 [2018-07-25 13:16:47,566 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:16:47,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-07-25 13:16:47,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 504. [2018-07-25 13:16:47,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-07-25 13:16:47,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 834 transitions. [2018-07-25 13:16:47,891 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 834 transitions. Word has length 18 [2018-07-25 13:16:47,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:47,891 INFO L472 AbstractCegarLoop]: Abstraction has 504 states and 834 transitions. [2018-07-25 13:16:47,891 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:16:47,892 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 834 transitions. [2018-07-25 13:16:47,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:16:47,892 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:47,892 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:47,893 INFO L415 AbstractCegarLoop]: === Iteration 99 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:47,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1655320734, now seen corresponding path program 2 times [2018-07-25 13:16:47,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:47,902 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:47,902 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:47,902 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:16:47,902 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:16:47,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:16:47,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:47,903 INFO L87 Difference]: Start difference. First operand 504 states and 834 transitions. Second operand 10 states. [2018-07-25 13:16:48,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:48,459 INFO L93 Difference]: Finished difference Result 630 states and 1024 transitions. [2018-07-25 13:16:48,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:16:48,459 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-25 13:16:48,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:48,460 INFO L225 Difference]: With dead ends: 630 [2018-07-25 13:16:48,460 INFO L226 Difference]: Without dead ends: 628 [2018-07-25 13:16:48,460 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:16:48,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-07-25 13:16:48,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 509. [2018-07-25 13:16:48,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-07-25 13:16:48,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 843 transitions. [2018-07-25 13:16:48,791 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 843 transitions. Word has length 18 [2018-07-25 13:16:48,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:48,792 INFO L472 AbstractCegarLoop]: Abstraction has 509 states and 843 transitions. [2018-07-25 13:16:48,792 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:16:48,792 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 843 transitions. [2018-07-25 13:16:48,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:16:48,792 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:48,792 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:48,792 INFO L415 AbstractCegarLoop]: === Iteration 100 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:48,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1646731795, now seen corresponding path program 2 times [2018-07-25 13:16:48,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:48,803 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:48,803 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:48,803 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:16:48,803 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:16:48,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:16:48,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:48,804 INFO L87 Difference]: Start difference. First operand 509 states and 843 transitions. Second operand 10 states. [2018-07-25 13:16:49,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:49,598 INFO L93 Difference]: Finished difference Result 620 states and 1007 transitions. [2018-07-25 13:16:49,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 13:16:49,598 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-25 13:16:49,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:49,599 INFO L225 Difference]: With dead ends: 620 [2018-07-25 13:16:49,599 INFO L226 Difference]: Without dead ends: 618 [2018-07-25 13:16:49,599 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:16:49,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-07-25 13:16:50,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 510. [2018-07-25 13:16:50,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2018-07-25 13:16:50,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 845 transitions. [2018-07-25 13:16:50,189 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 845 transitions. Word has length 18 [2018-07-25 13:16:50,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:50,189 INFO L472 AbstractCegarLoop]: Abstraction has 510 states and 845 transitions. [2018-07-25 13:16:50,189 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:16:50,189 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 845 transitions. [2018-07-25 13:16:50,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:16:50,190 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:50,193 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:50,193 INFO L415 AbstractCegarLoop]: === Iteration 101 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:50,193 INFO L82 PathProgramCache]: Analyzing trace with hash -800331771, now seen corresponding path program 3 times [2018-07-25 13:16:50,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:50,223 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:50,224 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:50,224 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:16:50,224 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:16:50,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:16:50,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:50,225 INFO L87 Difference]: Start difference. First operand 510 states and 845 transitions. Second operand 10 states. [2018-07-25 13:16:50,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:50,873 INFO L93 Difference]: Finished difference Result 703 states and 1148 transitions. [2018-07-25 13:16:50,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:16:50,873 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-25 13:16:50,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:50,874 INFO L225 Difference]: With dead ends: 703 [2018-07-25 13:16:50,874 INFO L226 Difference]: Without dead ends: 701 [2018-07-25 13:16:50,875 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:16:50,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-07-25 13:16:51,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 530. [2018-07-25 13:16:51,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-07-25 13:16:51,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 879 transitions. [2018-07-25 13:16:51,221 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 879 transitions. Word has length 18 [2018-07-25 13:16:51,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:51,221 INFO L472 AbstractCegarLoop]: Abstraction has 530 states and 879 transitions. [2018-07-25 13:16:51,221 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:16:51,221 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 879 transitions. [2018-07-25 13:16:51,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:16:51,221 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:51,222 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:51,222 INFO L415 AbstractCegarLoop]: === Iteration 102 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:51,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1149501708, now seen corresponding path program 1 times [2018-07-25 13:16:51,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:51,231 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:51,231 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:51,231 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:16:51,232 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:16:51,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:16:51,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:51,232 INFO L87 Difference]: Start difference. First operand 530 states and 879 transitions. Second operand 10 states. [2018-07-25 13:16:51,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:51,827 INFO L93 Difference]: Finished difference Result 642 states and 1045 transitions. [2018-07-25 13:16:51,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:16:51,827 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-25 13:16:51,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:51,828 INFO L225 Difference]: With dead ends: 642 [2018-07-25 13:16:51,828 INFO L226 Difference]: Without dead ends: 640 [2018-07-25 13:16:51,829 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:16:51,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-07-25 13:16:52,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 524. [2018-07-25 13:16:52,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-07-25 13:16:52,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 869 transitions. [2018-07-25 13:16:52,190 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 869 transitions. Word has length 18 [2018-07-25 13:16:52,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:52,190 INFO L472 AbstractCegarLoop]: Abstraction has 524 states and 869 transitions. [2018-07-25 13:16:52,190 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:16:52,190 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 869 transitions. [2018-07-25 13:16:52,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:16:52,191 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:52,191 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:52,191 INFO L415 AbstractCegarLoop]: === Iteration 103 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:52,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1140912769, now seen corresponding path program 1 times [2018-07-25 13:16:52,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:52,202 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:52,203 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:52,203 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:16:52,203 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:16:52,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:16:52,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:52,204 INFO L87 Difference]: Start difference. First operand 524 states and 869 transitions. Second operand 10 states. [2018-07-25 13:16:52,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:52,711 INFO L93 Difference]: Finished difference Result 591 states and 958 transitions. [2018-07-25 13:16:52,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:16:52,711 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-25 13:16:52,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:52,712 INFO L225 Difference]: With dead ends: 591 [2018-07-25 13:16:52,712 INFO L226 Difference]: Without dead ends: 589 [2018-07-25 13:16:52,712 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:16:52,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-07-25 13:16:53,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 502. [2018-07-25 13:16:53,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-07-25 13:16:53,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 831 transitions. [2018-07-25 13:16:53,051 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 831 transitions. Word has length 18 [2018-07-25 13:16:53,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:53,051 INFO L472 AbstractCegarLoop]: Abstraction has 502 states and 831 transitions. [2018-07-25 13:16:53,051 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:16:53,051 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 831 transitions. [2018-07-25 13:16:53,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:16:53,052 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:53,052 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:53,052 INFO L415 AbstractCegarLoop]: === Iteration 104 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:53,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1070077282, now seen corresponding path program 1 times [2018-07-25 13:16:53,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:53,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:53,063 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:53,063 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:16:53,064 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:16:53,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:16:53,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:16:53,064 INFO L87 Difference]: Start difference. First operand 502 states and 831 transitions. Second operand 10 states. [2018-07-25 13:16:53,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:53,646 INFO L93 Difference]: Finished difference Result 576 states and 935 transitions. [2018-07-25 13:16:53,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 13:16:53,646 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-25 13:16:53,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:53,647 INFO L225 Difference]: With dead ends: 576 [2018-07-25 13:16:53,647 INFO L226 Difference]: Without dead ends: 574 [2018-07-25 13:16:53,647 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:16:53,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-07-25 13:16:53,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 490. [2018-07-25 13:16:53,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-07-25 13:16:53,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 811 transitions. [2018-07-25 13:16:53,982 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 811 transitions. Word has length 18 [2018-07-25 13:16:53,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:53,982 INFO L472 AbstractCegarLoop]: Abstraction has 490 states and 811 transitions. [2018-07-25 13:16:53,982 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:16:53,982 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 811 transitions. [2018-07-25 13:16:53,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:16:53,983 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:53,983 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:53,983 INFO L415 AbstractCegarLoop]: === Iteration 105 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:53,983 INFO L82 PathProgramCache]: Analyzing trace with hash -850531879, now seen corresponding path program 3 times [2018-07-25 13:16:53,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:54,002 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:54,002 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:54,002 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:16:54,003 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:16:54,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:16:54,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:16:54,003 INFO L87 Difference]: Start difference. First operand 490 states and 811 transitions. Second operand 14 states. [2018-07-25 13:16:54,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:54,412 INFO L93 Difference]: Finished difference Result 502 states and 819 transitions. [2018-07-25 13:16:54,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:16:54,412 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-07-25 13:16:54,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:54,413 INFO L225 Difference]: With dead ends: 502 [2018-07-25 13:16:54,413 INFO L226 Difference]: Without dead ends: 501 [2018-07-25 13:16:54,413 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:16:54,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-07-25 13:16:54,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 454. [2018-07-25 13:16:54,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-07-25 13:16:54,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 750 transitions. [2018-07-25 13:16:54,736 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 750 transitions. Word has length 20 [2018-07-25 13:16:54,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:54,737 INFO L472 AbstractCegarLoop]: Abstraction has 454 states and 750 transitions. [2018-07-25 13:16:54,737 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:16:54,737 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 750 transitions. [2018-07-25 13:16:54,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:16:54,737 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:54,737 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:54,737 INFO L415 AbstractCegarLoop]: === Iteration 106 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:54,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1707385863, now seen corresponding path program 1 times [2018-07-25 13:16:54,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:54,754 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:54,754 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:54,754 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:16:54,755 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:16:54,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:16:54,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:16:54,755 INFO L87 Difference]: Start difference. First operand 454 states and 750 transitions. Second operand 14 states. [2018-07-25 13:16:55,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:55,255 INFO L93 Difference]: Finished difference Result 549 states and 901 transitions. [2018-07-25 13:16:55,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:16:55,255 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-07-25 13:16:55,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:55,256 INFO L225 Difference]: With dead ends: 549 [2018-07-25 13:16:55,256 INFO L226 Difference]: Without dead ends: 548 [2018-07-25 13:16:55,256 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:16:55,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-07-25 13:16:55,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 465. [2018-07-25 13:16:55,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-07-25 13:16:55,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 769 transitions. [2018-07-25 13:16:55,587 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 769 transitions. Word has length 20 [2018-07-25 13:16:55,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:55,588 INFO L472 AbstractCegarLoop]: Abstraction has 465 states and 769 transitions. [2018-07-25 13:16:55,588 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:16:55,588 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 769 transitions. [2018-07-25 13:16:55,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:16:55,588 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:55,588 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:55,588 INFO L415 AbstractCegarLoop]: === Iteration 107 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:55,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1999268581, now seen corresponding path program 2 times [2018-07-25 13:16:55,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:55,606 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:55,606 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:55,606 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:16:55,606 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:16:55,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:16:55,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:16:55,607 INFO L87 Difference]: Start difference. First operand 465 states and 769 transitions. Second operand 14 states. [2018-07-25 13:16:56,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:56,070 INFO L93 Difference]: Finished difference Result 510 states and 832 transitions. [2018-07-25 13:16:56,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:16:56,071 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-07-25 13:16:56,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:56,072 INFO L225 Difference]: With dead ends: 510 [2018-07-25 13:16:56,072 INFO L226 Difference]: Without dead ends: 508 [2018-07-25 13:16:56,072 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:16:56,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2018-07-25 13:16:56,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 449. [2018-07-25 13:16:56,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-07-25 13:16:56,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 743 transitions. [2018-07-25 13:16:56,408 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 743 transitions. Word has length 20 [2018-07-25 13:16:56,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:56,408 INFO L472 AbstractCegarLoop]: Abstraction has 449 states and 743 transitions. [2018-07-25 13:16:56,408 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:16:56,408 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 743 transitions. [2018-07-25 13:16:56,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:16:56,408 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:56,409 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:56,409 INFO L415 AbstractCegarLoop]: === Iteration 108 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:56,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1514664426, now seen corresponding path program 1 times [2018-07-25 13:16:56,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:56,427 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:56,427 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:56,427 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:16:56,427 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:16:56,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:16:56,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:16:56,428 INFO L87 Difference]: Start difference. First operand 449 states and 743 transitions. Second operand 13 states. [2018-07-25 13:16:57,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:57,024 INFO L93 Difference]: Finished difference Result 529 states and 854 transitions. [2018-07-25 13:16:57,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-25 13:16:57,024 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-07-25 13:16:57,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:57,025 INFO L225 Difference]: With dead ends: 529 [2018-07-25 13:16:57,025 INFO L226 Difference]: Without dead ends: 528 [2018-07-25 13:16:57,026 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=297, Invalid=1343, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:16:57,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-07-25 13:16:57,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 445. [2018-07-25 13:16:57,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-07-25 13:16:57,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 737 transitions. [2018-07-25 13:16:57,385 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 737 transitions. Word has length 20 [2018-07-25 13:16:57,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:57,385 INFO L472 AbstractCegarLoop]: Abstraction has 445 states and 737 transitions. [2018-07-25 13:16:57,385 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:16:57,385 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 737 transitions. [2018-07-25 13:16:57,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:16:57,386 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:57,386 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:57,386 INFO L415 AbstractCegarLoop]: === Iteration 109 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:57,386 INFO L82 PathProgramCache]: Analyzing trace with hash -390222799, now seen corresponding path program 4 times [2018-07-25 13:16:57,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:57,402 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:57,403 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:57,403 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 13:16:57,403 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 13:16:57,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 13:16:57,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:16:57,403 INFO L87 Difference]: Start difference. First operand 445 states and 737 transitions. Second operand 15 states. [2018-07-25 13:16:57,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:57,961 INFO L93 Difference]: Finished difference Result 502 states and 814 transitions. [2018-07-25 13:16:57,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 13:16:57,961 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20 [2018-07-25 13:16:57,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:57,961 INFO L225 Difference]: With dead ends: 502 [2018-07-25 13:16:57,961 INFO L226 Difference]: Without dead ends: 501 [2018-07-25 13:16:57,962 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=247, Invalid=1013, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 13:16:57,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-07-25 13:16:58,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 459. [2018-07-25 13:16:58,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-07-25 13:16:58,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 759 transitions. [2018-07-25 13:16:58,299 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 759 transitions. Word has length 20 [2018-07-25 13:16:58,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:58,299 INFO L472 AbstractCegarLoop]: Abstraction has 459 states and 759 transitions. [2018-07-25 13:16:58,299 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 13:16:58,299 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 759 transitions. [2018-07-25 13:16:58,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:16:58,300 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:58,300 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:58,300 INFO L415 AbstractCegarLoop]: === Iteration 110 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:58,300 INFO L82 PathProgramCache]: Analyzing trace with hash -2059824409, now seen corresponding path program 2 times [2018-07-25 13:16:58,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:58,315 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:58,316 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:58,316 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:16:58,316 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:16:58,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:16:58,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:16:58,316 INFO L87 Difference]: Start difference. First operand 459 states and 759 transitions. Second operand 14 states. [2018-07-25 13:16:58,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:58,817 INFO L93 Difference]: Finished difference Result 521 states and 849 transitions. [2018-07-25 13:16:58,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:16:58,818 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-07-25 13:16:58,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:58,818 INFO L225 Difference]: With dead ends: 521 [2018-07-25 13:16:58,818 INFO L226 Difference]: Without dead ends: 520 [2018-07-25 13:16:58,819 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:16:58,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2018-07-25 13:16:59,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 489. [2018-07-25 13:16:59,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-07-25 13:16:59,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 808 transitions. [2018-07-25 13:16:59,180 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 808 transitions. Word has length 20 [2018-07-25 13:16:59,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:59,180 INFO L472 AbstractCegarLoop]: Abstraction has 489 states and 808 transitions. [2018-07-25 13:16:59,180 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:16:59,180 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 808 transitions. [2018-07-25 13:16:59,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:16:59,181 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:59,181 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:59,181 INFO L415 AbstractCegarLoop]: === Iteration 111 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:59,181 INFO L82 PathProgramCache]: Analyzing trace with hash -781467557, now seen corresponding path program 1 times [2018-07-25 13:16:59,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:59,199 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:59,199 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:59,199 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:16:59,200 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:16:59,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:16:59,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:16:59,200 INFO L87 Difference]: Start difference. First operand 489 states and 808 transitions. Second operand 14 states. [2018-07-25 13:16:59,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:59,858 INFO L93 Difference]: Finished difference Result 578 states and 932 transitions. [2018-07-25 13:16:59,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 13:16:59,858 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-07-25 13:16:59,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:59,859 INFO L225 Difference]: With dead ends: 578 [2018-07-25 13:16:59,859 INFO L226 Difference]: Without dead ends: 576 [2018-07-25 13:16:59,859 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=224, Invalid=1258, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:16:59,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-07-25 13:17:00,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 493. [2018-07-25 13:17:00,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-07-25 13:17:00,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 815 transitions. [2018-07-25 13:17:00,228 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 815 transitions. Word has length 20 [2018-07-25 13:17:00,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:00,229 INFO L472 AbstractCegarLoop]: Abstraction has 493 states and 815 transitions. [2018-07-25 13:17:00,229 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:17:00,229 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 815 transitions. [2018-07-25 13:17:00,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:17:00,229 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:00,229 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:00,230 INFO L415 AbstractCegarLoop]: === Iteration 112 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:00,230 INFO L82 PathProgramCache]: Analyzing trace with hash -874261799, now seen corresponding path program 5 times [2018-07-25 13:17:00,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:00,246 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:00,246 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:00,246 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 13:17:00,246 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 13:17:00,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 13:17:00,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:17:00,247 INFO L87 Difference]: Start difference. First operand 493 states and 815 transitions. Second operand 15 states. [2018-07-25 13:17:00,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:00,998 INFO L93 Difference]: Finished difference Result 600 states and 981 transitions. [2018-07-25 13:17:00,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 13:17:00,998 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20 [2018-07-25 13:17:00,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:00,999 INFO L225 Difference]: With dead ends: 600 [2018-07-25 13:17:00,999 INFO L226 Difference]: Without dead ends: 599 [2018-07-25 13:17:00,999 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:17:01,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-07-25 13:17:01,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 498. [2018-07-25 13:17:01,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2018-07-25 13:17:01,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 825 transitions. [2018-07-25 13:17:01,389 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 825 transitions. Word has length 20 [2018-07-25 13:17:01,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:01,389 INFO L472 AbstractCegarLoop]: Abstraction has 498 states and 825 transitions. [2018-07-25 13:17:01,389 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 13:17:01,389 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 825 transitions. [2018-07-25 13:17:01,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:17:01,389 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:01,390 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:01,390 INFO L415 AbstractCegarLoop]: === Iteration 113 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:01,390 INFO L82 PathProgramCache]: Analyzing trace with hash -872968933, now seen corresponding path program 2 times [2018-07-25 13:17:01,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:01,409 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:01,410 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:01,410 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:17:01,410 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:17:01,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:17:01,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:17:01,411 INFO L87 Difference]: Start difference. First operand 498 states and 825 transitions. Second operand 14 states. [2018-07-25 13:17:02,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:02,320 INFO L93 Difference]: Finished difference Result 829 states and 1342 transitions. [2018-07-25 13:17:02,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-25 13:17:02,321 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-07-25 13:17:02,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:02,322 INFO L225 Difference]: With dead ends: 829 [2018-07-25 13:17:02,322 INFO L226 Difference]: Without dead ends: 827 [2018-07-25 13:17:02,322 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=275, Invalid=1705, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:17:02,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2018-07-25 13:17:02,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 612. [2018-07-25 13:17:02,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-07-25 13:17:02,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1017 transitions. [2018-07-25 13:17:02,754 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1017 transitions. Word has length 20 [2018-07-25 13:17:02,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:02,754 INFO L472 AbstractCegarLoop]: Abstraction has 612 states and 1017 transitions. [2018-07-25 13:17:02,754 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:17:02,754 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1017 transitions. [2018-07-25 13:17:02,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:17:02,755 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:02,755 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:02,755 INFO L415 AbstractCegarLoop]: === Iteration 114 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:02,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1388091879, now seen corresponding path program 1 times [2018-07-25 13:17:02,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:02,779 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:02,779 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:02,780 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:17:02,780 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:17:02,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:17:02,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:17:02,780 INFO L87 Difference]: Start difference. First operand 612 states and 1017 transitions. Second operand 13 states. [2018-07-25 13:17:03,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:03,548 INFO L93 Difference]: Finished difference Result 696 states and 1138 transitions. [2018-07-25 13:17:03,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 13:17:03,548 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-07-25 13:17:03,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:03,549 INFO L225 Difference]: With dead ends: 696 [2018-07-25 13:17:03,549 INFO L226 Difference]: Without dead ends: 694 [2018-07-25 13:17:03,549 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=194, Invalid=928, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:17:03,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2018-07-25 13:17:04,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 643. [2018-07-25 13:17:04,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2018-07-25 13:17:04,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1068 transitions. [2018-07-25 13:17:04,046 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1068 transitions. Word has length 20 [2018-07-25 13:17:04,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:04,047 INFO L472 AbstractCegarLoop]: Abstraction has 643 states and 1068 transitions. [2018-07-25 13:17:04,047 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:17:04,047 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1068 transitions. [2018-07-25 13:17:04,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:17:04,047 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:04,047 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:04,048 INFO L415 AbstractCegarLoop]: === Iteration 115 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:04,048 INFO L82 PathProgramCache]: Analyzing trace with hash 149319872, now seen corresponding path program 3 times [2018-07-25 13:17:04,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:04,054 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:04,054 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:04,055 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:17:04,055 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:17:04,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:17:04,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:17:04,055 INFO L87 Difference]: Start difference. First operand 643 states and 1068 transitions. Second operand 7 states. [2018-07-25 13:17:05,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:05,184 INFO L93 Difference]: Finished difference Result 2025 states and 3340 transitions. [2018-07-25 13:17:05,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:17:05,184 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-07-25 13:17:05,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:05,186 INFO L225 Difference]: With dead ends: 2025 [2018-07-25 13:17:05,186 INFO L226 Difference]: Without dead ends: 1397 [2018-07-25 13:17:05,188 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:17:05,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2018-07-25 13:17:06,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 1239. [2018-07-25 13:17:06,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2018-07-25 13:17:06,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 2029 transitions. [2018-07-25 13:17:06,163 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 2029 transitions. Word has length 20 [2018-07-25 13:17:06,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:06,163 INFO L472 AbstractCegarLoop]: Abstraction has 1239 states and 2029 transitions. [2018-07-25 13:17:06,163 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:17:06,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 2029 transitions. [2018-07-25 13:17:06,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:17:06,165 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:06,165 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:06,165 INFO L415 AbstractCegarLoop]: === Iteration 116 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:06,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1603097883, now seen corresponding path program 1 times [2018-07-25 13:17:06,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:06,186 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-25 13:17:06,187 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:06,187 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:17:06,187 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:17:06,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:17:06,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:17:06,187 INFO L87 Difference]: Start difference. First operand 1239 states and 2029 transitions. Second operand 13 states. [2018-07-25 13:17:07,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:07,414 INFO L93 Difference]: Finished difference Result 1356 states and 2197 transitions. [2018-07-25 13:17:07,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 13:17:07,414 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-07-25 13:17:07,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:07,415 INFO L225 Difference]: With dead ends: 1356 [2018-07-25 13:17:07,415 INFO L226 Difference]: Without dead ends: 1354 [2018-07-25 13:17:07,416 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=215, Invalid=1117, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:17:07,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-07-25 13:17:08,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1251. [2018-07-25 13:17:08,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1251 states. [2018-07-25 13:17:08,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 2049 transitions. [2018-07-25 13:17:08,370 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 2049 transitions. Word has length 20 [2018-07-25 13:17:08,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:08,370 INFO L472 AbstractCegarLoop]: Abstraction has 1251 states and 2049 transitions. [2018-07-25 13:17:08,370 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:17:08,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 2049 transitions. [2018-07-25 13:17:08,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:17:08,371 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:08,371 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:08,371 INFO L415 AbstractCegarLoop]: === Iteration 117 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:08,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1503357634, now seen corresponding path program 2 times [2018-07-25 13:17:08,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:08,395 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:08,395 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:08,395 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:17:08,396 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:17:08,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:17:08,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:17:08,396 INFO L87 Difference]: Start difference. First operand 1251 states and 2049 transitions. Second operand 13 states. [2018-07-25 13:17:09,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:09,672 INFO L93 Difference]: Finished difference Result 1410 states and 2292 transitions. [2018-07-25 13:17:09,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 13:17:09,672 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-07-25 13:17:09,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:09,674 INFO L225 Difference]: With dead ends: 1410 [2018-07-25 13:17:09,674 INFO L226 Difference]: Without dead ends: 1408 [2018-07-25 13:17:09,674 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:17:09,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2018-07-25 13:17:10,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1272. [2018-07-25 13:17:10,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2018-07-25 13:17:10,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 2080 transitions. [2018-07-25 13:17:10,676 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 2080 transitions. Word has length 20 [2018-07-25 13:17:10,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:10,677 INFO L472 AbstractCegarLoop]: Abstraction has 1272 states and 2080 transitions. [2018-07-25 13:17:10,677 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:17:10,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 2080 transitions. [2018-07-25 13:17:10,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:17:10,677 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:10,678 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:10,678 INFO L415 AbstractCegarLoop]: === Iteration 118 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:10,678 INFO L82 PathProgramCache]: Analyzing trace with hash 418443550, now seen corresponding path program 1 times [2018-07-25 13:17:10,678 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:10,692 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:10,692 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:17:10,692 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:17:10,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:17:10,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:17:10,693 INFO L87 Difference]: Start difference. First operand 1272 states and 2080 transitions. Second operand 13 states. [2018-07-25 13:17:11,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:11,809 INFO L93 Difference]: Finished difference Result 1365 states and 2218 transitions. [2018-07-25 13:17:11,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 13:17:11,810 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-07-25 13:17:11,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:11,811 INFO L225 Difference]: With dead ends: 1365 [2018-07-25 13:17:11,811 INFO L226 Difference]: Without dead ends: 1364 [2018-07-25 13:17:11,812 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:17:11,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2018-07-25 13:17:12,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1342. [2018-07-25 13:17:12,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2018-07-25 13:17:12,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 2190 transitions. [2018-07-25 13:17:12,872 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 2190 transitions. Word has length 20 [2018-07-25 13:17:12,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:12,873 INFO L472 AbstractCegarLoop]: Abstraction has 1342 states and 2190 transitions. [2018-07-25 13:17:12,873 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:17:12,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 2190 transitions. [2018-07-25 13:17:12,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:17:12,874 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:12,874 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:12,874 INFO L415 AbstractCegarLoop]: === Iteration 119 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:12,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1962310520, now seen corresponding path program 4 times [2018-07-25 13:17:12,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:12,882 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 13:17:12,883 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:12,883 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:17:12,883 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:17:12,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:17:12,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:17:12,883 INFO L87 Difference]: Start difference. First operand 1342 states and 2190 transitions. Second operand 7 states. [2018-07-25 13:17:14,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:14,354 INFO L93 Difference]: Finished difference Result 2545 states and 4127 transitions. [2018-07-25 13:17:14,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:17:14,354 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-07-25 13:17:14,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:14,355 INFO L225 Difference]: With dead ends: 2545 [2018-07-25 13:17:14,356 INFO L226 Difference]: Without dead ends: 1760 [2018-07-25 13:17:14,356 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:17:14,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2018-07-25 13:17:15,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1331. [2018-07-25 13:17:15,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-07-25 13:17:15,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2166 transitions. [2018-07-25 13:17:15,436 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2166 transitions. Word has length 20 [2018-07-25 13:17:15,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:15,436 INFO L472 AbstractCegarLoop]: Abstraction has 1331 states and 2166 transitions. [2018-07-25 13:17:15,436 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:17:15,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2166 transitions. [2018-07-25 13:17:15,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:17:15,437 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:15,437 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:15,437 INFO L415 AbstractCegarLoop]: === Iteration 120 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:15,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1797340462, now seen corresponding path program 1 times [2018-07-25 13:17:15,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:15,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:15,448 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:15,448 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:17:15,449 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:17:15,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:17:15,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:17:15,449 INFO L87 Difference]: Start difference. First operand 1331 states and 2166 transitions. Second operand 12 states. [2018-07-25 13:17:16,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:16,929 INFO L93 Difference]: Finished difference Result 1610 states and 2608 transitions. [2018-07-25 13:17:16,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:17:16,929 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-07-25 13:17:16,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:16,930 INFO L225 Difference]: With dead ends: 1610 [2018-07-25 13:17:16,931 INFO L226 Difference]: Without dead ends: 1608 [2018-07-25 13:17:16,931 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:17:16,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2018-07-25 13:17:18,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1436. [2018-07-25 13:17:18,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1436 states. [2018-07-25 13:17:18,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 2341 transitions. [2018-07-25 13:17:18,156 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 2341 transitions. Word has length 20 [2018-07-25 13:17:18,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:18,156 INFO L472 AbstractCegarLoop]: Abstraction has 1436 states and 2341 transitions. [2018-07-25 13:17:18,156 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:17:18,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 2341 transitions. [2018-07-25 13:17:18,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:17:18,157 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:18,157 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:18,157 INFO L415 AbstractCegarLoop]: === Iteration 121 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:18,157 INFO L82 PathProgramCache]: Analyzing trace with hash -70738496, now seen corresponding path program 5 times [2018-07-25 13:17:18,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:18,166 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 13:17:18,167 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:18,167 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:17:18,167 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:17:18,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:17:18,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:17:18,167 INFO L87 Difference]: Start difference. First operand 1436 states and 2341 transitions. Second operand 7 states. [2018-07-25 13:17:19,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:19,762 INFO L93 Difference]: Finished difference Result 2745 states and 4471 transitions. [2018-07-25 13:17:19,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:17:19,762 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-07-25 13:17:19,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:19,764 INFO L225 Difference]: With dead ends: 2745 [2018-07-25 13:17:19,764 INFO L226 Difference]: Without dead ends: 1823 [2018-07-25 13:17:19,766 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:17:19,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2018-07-25 13:17:21,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1657. [2018-07-25 13:17:21,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1657 states. [2018-07-25 13:17:21,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2701 transitions. [2018-07-25 13:17:21,109 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2701 transitions. Word has length 20 [2018-07-25 13:17:21,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:21,109 INFO L472 AbstractCegarLoop]: Abstraction has 1657 states and 2701 transitions. [2018-07-25 13:17:21,110 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:17:21,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2701 transitions. [2018-07-25 13:17:21,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:17:21,110 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:21,111 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:21,111 INFO L415 AbstractCegarLoop]: === Iteration 122 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:21,111 INFO L82 PathProgramCache]: Analyzing trace with hash -70737726, now seen corresponding path program 2 times [2018-07-25 13:17:21,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:21,123 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:21,123 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:21,123 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:17:21,124 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:17:21,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:17:21,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:17:21,124 INFO L87 Difference]: Start difference. First operand 1657 states and 2701 transitions. Second operand 12 states. [2018-07-25 13:17:22,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:22,854 INFO L93 Difference]: Finished difference Result 1815 states and 2934 transitions. [2018-07-25 13:17:22,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:17:22,854 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-07-25 13:17:22,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:22,856 INFO L225 Difference]: With dead ends: 1815 [2018-07-25 13:17:22,856 INFO L226 Difference]: Without dead ends: 1813 [2018-07-25 13:17:22,856 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:17:22,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2018-07-25 13:17:24,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1651. [2018-07-25 13:17:24,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1651 states. [2018-07-25 13:17:24,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2690 transitions. [2018-07-25 13:17:24,200 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 2690 transitions. Word has length 20 [2018-07-25 13:17:24,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:24,200 INFO L472 AbstractCegarLoop]: Abstraction has 1651 states and 2690 transitions. [2018-07-25 13:17:24,200 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:17:24,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2690 transitions. [2018-07-25 13:17:24,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:17:24,201 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:24,201 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:24,201 INFO L415 AbstractCegarLoop]: === Iteration 123 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:24,201 INFO L82 PathProgramCache]: Analyzing trace with hash 56099968, now seen corresponding path program 1 times [2018-07-25 13:17:24,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:24,223 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:24,223 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:24,224 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:17:24,224 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:17:24,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:17:24,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:17:24,224 INFO L87 Difference]: Start difference. First operand 1651 states and 2690 transitions. Second operand 13 states. [2018-07-25 13:17:25,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:25,900 INFO L93 Difference]: Finished difference Result 1804 states and 2922 transitions. [2018-07-25 13:17:25,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 13:17:25,900 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-07-25 13:17:25,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:25,903 INFO L225 Difference]: With dead ends: 1804 [2018-07-25 13:17:25,903 INFO L226 Difference]: Without dead ends: 1802 [2018-07-25 13:17:25,903 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=183, Invalid=1077, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 13:17:25,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2018-07-25 13:17:27,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1635. [2018-07-25 13:17:27,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1635 states. [2018-07-25 13:17:27,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2664 transitions. [2018-07-25 13:17:27,301 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2664 transitions. Word has length 20 [2018-07-25 13:17:27,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:27,301 INFO L472 AbstractCegarLoop]: Abstraction has 1635 states and 2664 transitions. [2018-07-25 13:17:27,301 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:17:27,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2664 transitions. [2018-07-25 13:17:27,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:17:27,302 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:27,302 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:27,302 INFO L415 AbstractCegarLoop]: === Iteration 124 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:27,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1028814116, now seen corresponding path program 1 times [2018-07-25 13:17:27,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:27,319 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:27,319 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:27,319 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:17:27,320 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:17:27,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:17:27,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:17:27,320 INFO L87 Difference]: Start difference. First operand 1635 states and 2664 transitions. Second operand 13 states. [2018-07-25 13:17:29,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:29,136 INFO L93 Difference]: Finished difference Result 1702 states and 2762 transitions. [2018-07-25 13:17:29,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:17:29,136 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-07-25 13:17:29,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:29,138 INFO L225 Difference]: With dead ends: 1702 [2018-07-25 13:17:29,138 INFO L226 Difference]: Without dead ends: 1701 [2018-07-25 13:17:29,138 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:17:29,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2018-07-25 13:17:30,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1631. [2018-07-25 13:17:30,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1631 states. [2018-07-25 13:17:30,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2657 transitions. [2018-07-25 13:17:30,462 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2657 transitions. Word has length 20 [2018-07-25 13:17:30,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:30,462 INFO L472 AbstractCegarLoop]: Abstraction has 1631 states and 2657 transitions. [2018-07-25 13:17:30,462 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:17:30,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2657 transitions. [2018-07-25 13:17:30,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:17:30,463 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:30,463 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:30,463 INFO L415 AbstractCegarLoop]: === Iteration 125 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:30,464 INFO L82 PathProgramCache]: Analyzing trace with hash 294164016, now seen corresponding path program 1 times [2018-07-25 13:17:30,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:30,477 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:30,477 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:30,477 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:17:30,478 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:17:30,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:17:30,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:17:30,478 INFO L87 Difference]: Start difference. First operand 1631 states and 2657 transitions. Second operand 12 states. [2018-07-25 13:17:32,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:32,321 INFO L93 Difference]: Finished difference Result 1884 states and 3067 transitions. [2018-07-25 13:17:32,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:17:32,322 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-07-25 13:17:32,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:32,323 INFO L225 Difference]: With dead ends: 1884 [2018-07-25 13:17:32,323 INFO L226 Difference]: Without dead ends: 1883 [2018-07-25 13:17:32,324 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:17:32,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2018-07-25 13:17:33,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1605. [2018-07-25 13:17:33,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1605 states. [2018-07-25 13:17:33,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 2615 transitions. [2018-07-25 13:17:33,650 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 2615 transitions. Word has length 20 [2018-07-25 13:17:33,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:33,650 INFO L472 AbstractCegarLoop]: Abstraction has 1605 states and 2615 transitions. [2018-07-25 13:17:33,650 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:17:33,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 2615 transitions. [2018-07-25 13:17:33,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:17:33,651 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:33,651 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:33,652 INFO L415 AbstractCegarLoop]: === Iteration 126 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:33,652 INFO L82 PathProgramCache]: Analyzing trace with hash -503083984, now seen corresponding path program 1 times [2018-07-25 13:17:33,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:33,667 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:33,668 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:33,668 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:17:33,668 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:17:33,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:17:33,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:17:33,669 INFO L87 Difference]: Start difference. First operand 1605 states and 2615 transitions. Second operand 14 states. [2018-07-25 13:17:35,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:35,331 INFO L93 Difference]: Finished difference Result 1872 states and 3057 transitions. [2018-07-25 13:17:35,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:17:35,331 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-07-25 13:17:35,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:35,333 INFO L225 Difference]: With dead ends: 1872 [2018-07-25 13:17:35,334 INFO L226 Difference]: Without dead ends: 1871 [2018-07-25 13:17:35,334 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:17:35,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2018-07-25 13:17:36,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1694. [2018-07-25 13:17:36,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1694 states. [2018-07-25 13:17:36,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 2762 transitions. [2018-07-25 13:17:36,739 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 2762 transitions. Word has length 20 [2018-07-25 13:17:36,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:36,739 INFO L472 AbstractCegarLoop]: Abstraction has 1694 states and 2762 transitions. [2018-07-25 13:17:36,739 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:17:36,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2762 transitions. [2018-07-25 13:17:36,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:17:36,740 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:36,740 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:36,740 INFO L415 AbstractCegarLoop]: === Iteration 127 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:36,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1843127659, now seen corresponding path program 1 times [2018-07-25 13:17:36,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:36,753 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:36,754 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:36,754 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:17:36,754 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:17:36,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:17:36,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:17:36,755 INFO L87 Difference]: Start difference. First operand 1694 states and 2762 transitions. Second operand 12 states. [2018-07-25 13:17:38,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:38,472 INFO L93 Difference]: Finished difference Result 1818 states and 2952 transitions. [2018-07-25 13:17:38,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:17:38,472 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 13:17:38,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:38,475 INFO L225 Difference]: With dead ends: 1818 [2018-07-25 13:17:38,475 INFO L226 Difference]: Without dead ends: 1816 [2018-07-25 13:17:38,475 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:17:38,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2018-07-25 13:17:39,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1702. [2018-07-25 13:17:39,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1702 states. [2018-07-25 13:17:39,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 2774 transitions. [2018-07-25 13:17:39,896 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 2774 transitions. Word has length 21 [2018-07-25 13:17:39,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:39,896 INFO L472 AbstractCegarLoop]: Abstraction has 1702 states and 2774 transitions. [2018-07-25 13:17:39,896 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:17:39,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2774 transitions. [2018-07-25 13:17:39,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:17:39,897 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:39,897 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:39,898 INFO L415 AbstractCegarLoop]: === Iteration 128 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:39,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1652448723, now seen corresponding path program 1 times [2018-07-25 13:17:39,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:39,914 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:39,914 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:39,914 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:17:39,914 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:17:39,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:17:39,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:17:39,915 INFO L87 Difference]: Start difference. First operand 1702 states and 2774 transitions. Second operand 12 states. [2018-07-25 13:17:41,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:41,612 INFO L93 Difference]: Finished difference Result 1906 states and 3103 transitions. [2018-07-25 13:17:41,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:17:41,612 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 13:17:41,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:41,615 INFO L225 Difference]: With dead ends: 1906 [2018-07-25 13:17:41,615 INFO L226 Difference]: Without dead ends: 1904 [2018-07-25 13:17:41,615 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:17:41,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2018-07-25 13:17:43,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1715. [2018-07-25 13:17:43,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2018-07-25 13:17:43,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2795 transitions. [2018-07-25 13:17:43,083 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2795 transitions. Word has length 21 [2018-07-25 13:17:43,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:43,083 INFO L472 AbstractCegarLoop]: Abstraction has 1715 states and 2795 transitions. [2018-07-25 13:17:43,083 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:17:43,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2795 transitions. [2018-07-25 13:17:43,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:17:43,085 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:43,085 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:43,085 INFO L415 AbstractCegarLoop]: === Iteration 129 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:43,085 INFO L82 PathProgramCache]: Analyzing trace with hash -858694805, now seen corresponding path program 1 times [2018-07-25 13:17:43,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:43,096 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:43,096 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:43,097 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:17:43,097 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:17:43,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:17:43,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:17:43,097 INFO L87 Difference]: Start difference. First operand 1715 states and 2795 transitions. Second operand 12 states. [2018-07-25 13:17:44,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:44,923 INFO L93 Difference]: Finished difference Result 1953 states and 3181 transitions. [2018-07-25 13:17:44,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 13:17:44,924 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 13:17:44,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:44,926 INFO L225 Difference]: With dead ends: 1953 [2018-07-25 13:17:44,926 INFO L226 Difference]: Without dead ends: 1951 [2018-07-25 13:17:44,927 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=221, Invalid=901, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:17:44,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2018-07-25 13:17:46,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1700. [2018-07-25 13:17:46,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1700 states. [2018-07-25 13:17:46,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 2771 transitions. [2018-07-25 13:17:46,351 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 2771 transitions. Word has length 21 [2018-07-25 13:17:46,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:46,351 INFO L472 AbstractCegarLoop]: Abstraction has 1700 states and 2771 transitions. [2018-07-25 13:17:46,351 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:17:46,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2771 transitions. [2018-07-25 13:17:46,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 13:17:46,352 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:46,352 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-25 13:17:46,353 INFO L415 AbstractCegarLoop]: === Iteration 130 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:46,353 INFO L82 PathProgramCache]: Analyzing trace with hash -119563298, now seen corresponding path program 3 times [2018-07-25 13:17:46,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:46,376 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:46,376 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:46,376 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 13:17:46,377 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 13:17:46,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 13:17:46,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:17:46,377 INFO L87 Difference]: Start difference. First operand 1700 states and 2771 transitions. Second operand 16 states. [2018-07-25 13:17:48,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:48,048 INFO L93 Difference]: Finished difference Result 1765 states and 2860 transitions. [2018-07-25 13:17:48,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 13:17:48,049 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-07-25 13:17:48,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:48,051 INFO L225 Difference]: With dead ends: 1765 [2018-07-25 13:17:48,051 INFO L226 Difference]: Without dead ends: 1764 [2018-07-25 13:17:48,051 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=216, Invalid=974, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:17:48,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2018-07-25 13:17:49,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1611. [2018-07-25 13:17:49,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1611 states. [2018-07-25 13:17:49,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2624 transitions. [2018-07-25 13:17:49,434 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2624 transitions. Word has length 22 [2018-07-25 13:17:49,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:49,434 INFO L472 AbstractCegarLoop]: Abstraction has 1611 states and 2624 transitions. [2018-07-25 13:17:49,435 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 13:17:49,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2624 transitions. [2018-07-25 13:17:49,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 13:17:49,435 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:49,435 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-25 13:17:49,436 INFO L415 AbstractCegarLoop]: === Iteration 131 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:49,436 INFO L82 PathProgramCache]: Analyzing trace with hash 489410380, now seen corresponding path program 4 times [2018-07-25 13:17:49,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:49,456 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:49,456 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:49,457 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 13:17:49,457 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 13:17:49,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 13:17:49,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:17:49,457 INFO L87 Difference]: Start difference. First operand 1611 states and 2624 transitions. Second operand 16 states. [2018-07-25 13:17:51,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:51,158 INFO L93 Difference]: Finished difference Result 1706 states and 2757 transitions. [2018-07-25 13:17:51,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-25 13:17:51,158 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-07-25 13:17:51,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:51,160 INFO L225 Difference]: With dead ends: 1706 [2018-07-25 13:17:51,160 INFO L226 Difference]: Without dead ends: 1705 [2018-07-25 13:17:51,161 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=323, Invalid=1839, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:17:51,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2018-07-25 13:17:52,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1607. [2018-07-25 13:17:52,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1607 states. [2018-07-25 13:17:52,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 2615 transitions. [2018-07-25 13:17:52,587 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 2615 transitions. Word has length 22 [2018-07-25 13:17:52,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:52,587 INFO L472 AbstractCegarLoop]: Abstraction has 1607 states and 2615 transitions. [2018-07-25 13:17:52,587 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 13:17:52,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 2615 transitions. [2018-07-25 13:17:52,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 13:17:52,588 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:52,588 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:52,589 INFO L415 AbstractCegarLoop]: === Iteration 132 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:52,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1161738932, now seen corresponding path program 2 times [2018-07-25 13:17:52,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:52,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:52,615 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:52,616 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:52,616 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 13:17:52,616 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 13:17:52,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 13:17:52,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:17:52,616 INFO L87 Difference]: Start difference. First operand 1607 states and 2615 transitions. Second operand 15 states. [2018-07-25 13:17:54,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:54,391 INFO L93 Difference]: Finished difference Result 1768 states and 2871 transitions. [2018-07-25 13:17:54,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 13:17:54,391 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-07-25 13:17:54,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:54,393 INFO L225 Difference]: With dead ends: 1768 [2018-07-25 13:17:54,393 INFO L226 Difference]: Without dead ends: 1767 [2018-07-25 13:17:54,394 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:17:54,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2018-07-25 13:17:55,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1649. [2018-07-25 13:17:55,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1649 states. [2018-07-25 13:17:55,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2685 transitions. [2018-07-25 13:17:55,831 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2685 transitions. Word has length 22 [2018-07-25 13:17:55,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:55,831 INFO L472 AbstractCegarLoop]: Abstraction has 1649 states and 2685 transitions. [2018-07-25 13:17:55,831 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 13:17:55,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2685 transitions. [2018-07-25 13:17:55,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 13:17:55,832 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:55,832 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-25 13:17:55,832 INFO L415 AbstractCegarLoop]: === Iteration 133 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:55,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1611878626, now seen corresponding path program 5 times [2018-07-25 13:17:55,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:55,851 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:55,851 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:55,852 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 13:17:55,852 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 13:17:55,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 13:17:55,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:17:55,852 INFO L87 Difference]: Start difference. First operand 1649 states and 2685 transitions. Second operand 16 states. [2018-07-25 13:17:58,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:58,037 INFO L93 Difference]: Finished difference Result 1995 states and 3219 transitions. [2018-07-25 13:17:58,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-25 13:17:58,037 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-07-25 13:17:58,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:58,039 INFO L225 Difference]: With dead ends: 1995 [2018-07-25 13:17:58,039 INFO L226 Difference]: Without dead ends: 1994 [2018-07-25 13:17:58,040 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=347, Invalid=2203, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:17:58,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2018-07-25 13:17:59,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1676. [2018-07-25 13:17:59,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1676 states. [2018-07-25 13:17:59,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 2732 transitions. [2018-07-25 13:17:59,511 INFO L78 Accepts]: Start accepts. Automaton has 1676 states and 2732 transitions. Word has length 22 [2018-07-25 13:17:59,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:59,511 INFO L472 AbstractCegarLoop]: Abstraction has 1676 states and 2732 transitions. [2018-07-25 13:17:59,511 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 13:17:59,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 2732 transitions. [2018-07-25 13:17:59,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 13:17:59,512 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:59,512 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:59,513 INFO L415 AbstractCegarLoop]: === Iteration 134 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:59,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1825100773, now seen corresponding path program 1 times [2018-07-25 13:17:59,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:59,537 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:59,537 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:59,537 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 13:17:59,537 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 13:17:59,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 13:17:59,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:17:59,538 INFO L87 Difference]: Start difference. First operand 1676 states and 2732 transitions. Second operand 15 states. [2018-07-25 13:18:01,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:01,442 INFO L93 Difference]: Finished difference Result 1916 states and 3112 transitions. [2018-07-25 13:18:01,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 13:18:01,442 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-07-25 13:18:01,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:01,444 INFO L225 Difference]: With dead ends: 1916 [2018-07-25 13:18:01,444 INFO L226 Difference]: Without dead ends: 1914 [2018-07-25 13:18:01,444 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=214, Invalid=1192, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:18:01,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2018-07-25 13:18:03,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1767. [2018-07-25 13:18:03,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1767 states. [2018-07-25 13:18:03,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 2876 transitions. [2018-07-25 13:18:03,078 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 2876 transitions. Word has length 22 [2018-07-25 13:18:03,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:03,078 INFO L472 AbstractCegarLoop]: Abstraction has 1767 states and 2876 transitions. [2018-07-25 13:18:03,078 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 13:18:03,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2876 transitions. [2018-07-25 13:18:03,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 13:18:03,079 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:03,079 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:03,079 INFO L415 AbstractCegarLoop]: === Iteration 135 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:03,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1601377053, now seen corresponding path program 1 times [2018-07-25 13:18:03,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:03,098 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:03,098 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:03,098 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:18:03,098 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:18:03,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:18:03,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:18:03,099 INFO L87 Difference]: Start difference. First operand 1767 states and 2876 transitions. Second operand 14 states. [2018-07-25 13:18:04,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:04,786 INFO L93 Difference]: Finished difference Result 1874 states and 3046 transitions. [2018-07-25 13:18:04,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:18:04,787 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2018-07-25 13:18:04,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:04,789 INFO L225 Difference]: With dead ends: 1874 [2018-07-25 13:18:04,789 INFO L226 Difference]: Without dead ends: 1873 [2018-07-25 13:18:04,789 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:18:04,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2018-07-25 13:18:06,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1763. [2018-07-25 13:18:06,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1763 states. [2018-07-25 13:18:06,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 2871 transitions. [2018-07-25 13:18:06,361 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 2871 transitions. Word has length 22 [2018-07-25 13:18:06,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:06,361 INFO L472 AbstractCegarLoop]: Abstraction has 1763 states and 2871 transitions. [2018-07-25 13:18:06,361 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:18:06,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2871 transitions. [2018-07-25 13:18:06,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 13:18:06,362 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:06,362 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:06,363 INFO L415 AbstractCegarLoop]: === Iteration 136 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:06,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1715079645, now seen corresponding path program 1 times [2018-07-25 13:18:06,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:06,380 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:06,381 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:06,381 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 13:18:06,381 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 13:18:06,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 13:18:06,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:18:06,381 INFO L87 Difference]: Start difference. First operand 1763 states and 2871 transitions. Second operand 15 states. [2018-07-25 13:18:08,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:08,391 INFO L93 Difference]: Finished difference Result 1970 states and 3194 transitions. [2018-07-25 13:18:08,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 13:18:08,391 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-07-25 13:18:08,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:08,393 INFO L225 Difference]: With dead ends: 1970 [2018-07-25 13:18:08,393 INFO L226 Difference]: Without dead ends: 1968 [2018-07-25 13:18:08,393 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=221, Invalid=1261, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:18:08,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2018-07-25 13:18:09,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1712. [2018-07-25 13:18:09,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1712 states. [2018-07-25 13:18:09,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2788 transitions. [2018-07-25 13:18:09,927 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2788 transitions. Word has length 22 [2018-07-25 13:18:09,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:09,928 INFO L472 AbstractCegarLoop]: Abstraction has 1712 states and 2788 transitions. [2018-07-25 13:18:09,928 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 13:18:09,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2788 transitions. [2018-07-25 13:18:09,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 13:18:09,928 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:09,929 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-25 13:18:09,929 INFO L415 AbstractCegarLoop]: === Iteration 137 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:09,929 INFO L82 PathProgramCache]: Analyzing trace with hash -846590175, now seen corresponding path program 3 times [2018-07-25 13:18:09,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:09,948 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:09,948 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:09,948 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:18:09,949 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:18:09,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:18:09,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:18:09,949 INFO L87 Difference]: Start difference. First operand 1712 states and 2788 transitions. Second operand 14 states. [2018-07-25 13:18:11,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:11,835 INFO L93 Difference]: Finished difference Result 1872 states and 3041 transitions. [2018-07-25 13:18:11,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 13:18:11,835 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2018-07-25 13:18:11,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:11,837 INFO L225 Difference]: With dead ends: 1872 [2018-07-25 13:18:11,837 INFO L226 Difference]: Without dead ends: 1871 [2018-07-25 13:18:11,838 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:18:11,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2018-07-25 13:18:13,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1656. [2018-07-25 13:18:13,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1656 states. [2018-07-25 13:18:13,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2697 transitions. [2018-07-25 13:18:13,305 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2697 transitions. Word has length 22 [2018-07-25 13:18:13,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:13,305 INFO L472 AbstractCegarLoop]: Abstraction has 1656 states and 2697 transitions. [2018-07-25 13:18:13,305 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:18:13,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2697 transitions. [2018-07-25 13:18:13,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 13:18:13,306 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:13,306 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:13,306 INFO L415 AbstractCegarLoop]: === Iteration 138 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:13,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1868893045, now seen corresponding path program 2 times [2018-07-25 13:18:13,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:13,325 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:13,325 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:13,326 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 13:18:13,326 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 13:18:13,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 13:18:13,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:18:13,326 INFO L87 Difference]: Start difference. First operand 1656 states and 2697 transitions. Second operand 15 states. [2018-07-25 13:18:15,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:15,102 INFO L93 Difference]: Finished difference Result 1826 states and 2973 transitions. [2018-07-25 13:18:15,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:18:15,102 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-07-25 13:18:15,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:15,104 INFO L225 Difference]: With dead ends: 1826 [2018-07-25 13:18:15,105 INFO L226 Difference]: Without dead ends: 1825 [2018-07-25 13:18:15,105 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:18:15,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2018-07-25 13:18:16,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1527. [2018-07-25 13:18:16,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1527 states. [2018-07-25 13:18:16,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2487 transitions. [2018-07-25 13:18:16,457 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2487 transitions. Word has length 22 [2018-07-25 13:18:16,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:16,457 INFO L472 AbstractCegarLoop]: Abstraction has 1527 states and 2487 transitions. [2018-07-25 13:18:16,457 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 13:18:16,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2487 transitions. [2018-07-25 13:18:16,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 13:18:16,458 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:16,458 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:16,458 INFO L415 AbstractCegarLoop]: === Iteration 139 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:16,458 INFO L82 PathProgramCache]: Analyzing trace with hash 441602332, now seen corresponding path program 1 times [2018-07-25 13:18:16,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:16,473 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:16,473 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:16,473 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:18:16,473 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:18:16,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:18:16,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:18:16,474 INFO L87 Difference]: Start difference. First operand 1527 states and 2487 transitions. Second operand 14 states. [2018-07-25 13:18:18,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:18,088 INFO L93 Difference]: Finished difference Result 1634 states and 2653 transitions. [2018-07-25 13:18:18,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:18:18,088 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-07-25 13:18:18,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:18,090 INFO L225 Difference]: With dead ends: 1634 [2018-07-25 13:18:18,090 INFO L226 Difference]: Without dead ends: 1633 [2018-07-25 13:18:18,091 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:18:18,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2018-07-25 13:18:19,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1575. [2018-07-25 13:18:19,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2018-07-25 13:18:19,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2566 transitions. [2018-07-25 13:18:19,592 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2566 transitions. Word has length 23 [2018-07-25 13:18:19,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:19,592 INFO L472 AbstractCegarLoop]: Abstraction has 1575 states and 2566 transitions. [2018-07-25 13:18:19,592 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:18:19,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2566 transitions. [2018-07-25 13:18:19,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 13:18:19,593 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:19,593 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:19,593 INFO L415 AbstractCegarLoop]: === Iteration 140 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:19,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1719959184, now seen corresponding path program 1 times [2018-07-25 13:18:19,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:19,612 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:19,612 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:19,612 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:18:19,613 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:18:19,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:18:19,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:18:19,613 INFO L87 Difference]: Start difference. First operand 1575 states and 2566 transitions. Second operand 14 states. [2018-07-25 13:18:21,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:21,373 INFO L93 Difference]: Finished difference Result 1685 states and 2725 transitions. [2018-07-25 13:18:21,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 13:18:21,373 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-07-25 13:18:21,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:21,375 INFO L225 Difference]: With dead ends: 1685 [2018-07-25 13:18:21,375 INFO L226 Difference]: Without dead ends: 1683 [2018-07-25 13:18:21,376 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=287, Invalid=1119, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:18:21,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2018-07-25 13:18:22,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1575. [2018-07-25 13:18:22,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2018-07-25 13:18:22,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2566 transitions. [2018-07-25 13:18:22,812 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2566 transitions. Word has length 23 [2018-07-25 13:18:22,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:22,812 INFO L472 AbstractCegarLoop]: Abstraction has 1575 states and 2566 transitions. [2018-07-25 13:18:22,812 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:18:22,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2566 transitions. [2018-07-25 13:18:22,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 13:18:22,813 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:22,813 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:22,813 INFO L415 AbstractCegarLoop]: === Iteration 141 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:22,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1628457808, now seen corresponding path program 2 times [2018-07-25 13:18:22,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:22,825 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:22,825 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:22,826 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:18:22,826 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:18:22,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:18:22,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:18:22,826 INFO L87 Difference]: Start difference. First operand 1575 states and 2566 transitions. Second operand 14 states. [2018-07-25 13:18:24,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:24,955 INFO L93 Difference]: Finished difference Result 2088 states and 3396 transitions. [2018-07-25 13:18:24,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-25 13:18:24,955 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-07-25 13:18:24,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:24,957 INFO L225 Difference]: With dead ends: 2088 [2018-07-25 13:18:24,958 INFO L226 Difference]: Without dead ends: 2086 [2018-07-25 13:18:24,958 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=399, Invalid=2151, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:18:24,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2018-07-25 13:18:26,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 1710. [2018-07-25 13:18:26,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2018-07-25 13:18:26,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2793 transitions. [2018-07-25 13:18:26,464 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2793 transitions. Word has length 23 [2018-07-25 13:18:26,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:26,464 INFO L472 AbstractCegarLoop]: Abstraction has 1710 states and 2793 transitions. [2018-07-25 13:18:26,464 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:18:26,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2793 transitions. [2018-07-25 13:18:26,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 13:18:26,465 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:26,465 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:26,466 INFO L415 AbstractCegarLoop]: === Iteration 142 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:26,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1349164405, now seen corresponding path program 3 times [2018-07-25 13:18:26,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:26,480 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:26,480 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:26,480 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 13:18:26,480 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 13:18:26,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 13:18:26,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:18:26,481 INFO L87 Difference]: Start difference. First operand 1710 states and 2793 transitions. Second operand 16 states. [2018-07-25 13:18:28,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:28,223 INFO L93 Difference]: Finished difference Result 1839 states and 2998 transitions. [2018-07-25 13:18:28,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:18:28,223 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-07-25 13:18:28,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:28,225 INFO L225 Difference]: With dead ends: 1839 [2018-07-25 13:18:28,225 INFO L226 Difference]: Without dead ends: 1838 [2018-07-25 13:18:28,226 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=166, Invalid=704, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:18:28,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2018-07-25 13:18:29,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1750. [2018-07-25 13:18:29,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2018-07-25 13:18:29,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2860 transitions. [2018-07-25 13:18:29,803 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2860 transitions. Word has length 23 [2018-07-25 13:18:29,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:29,803 INFO L472 AbstractCegarLoop]: Abstraction has 1750 states and 2860 transitions. [2018-07-25 13:18:29,803 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 13:18:29,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2860 transitions. [2018-07-25 13:18:29,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 13:18:29,804 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:29,804 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:29,804 INFO L415 AbstractCegarLoop]: === Iteration 143 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:29,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1977166985, now seen corresponding path program 1 times [2018-07-25 13:18:29,805 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:29,820 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:29,820 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:29,820 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 13:18:29,820 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 13:18:29,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 13:18:29,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:18:29,821 INFO L87 Difference]: Start difference. First operand 1750 states and 2860 transitions. Second operand 15 states. [2018-07-25 13:18:31,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:31,760 INFO L93 Difference]: Finished difference Result 1875 states and 3050 transitions. [2018-07-25 13:18:31,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 13:18:31,760 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2018-07-25 13:18:31,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:31,763 INFO L225 Difference]: With dead ends: 1875 [2018-07-25 13:18:31,763 INFO L226 Difference]: Without dead ends: 1873 [2018-07-25 13:18:31,763 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=194, Invalid=996, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:18:31,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2018-07-25 13:18:33,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1738. [2018-07-25 13:18:33,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2018-07-25 13:18:33,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2840 transitions. [2018-07-25 13:18:33,282 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2840 transitions. Word has length 23 [2018-07-25 13:18:33,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:33,282 INFO L472 AbstractCegarLoop]: Abstraction has 1738 states and 2840 transitions. [2018-07-25 13:18:33,282 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 13:18:33,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2840 transitions. [2018-07-25 13:18:33,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 13:18:33,283 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:33,283 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:33,283 INFO L415 AbstractCegarLoop]: === Iteration 144 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:33,283 INFO L82 PathProgramCache]: Analyzing trace with hash -451471923, now seen corresponding path program 4 times [2018-07-25 13:18:33,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:33,300 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:33,301 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:33,301 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 13:18:33,301 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 13:18:33,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 13:18:33,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:18:33,302 INFO L87 Difference]: Start difference. First operand 1738 states and 2840 transitions. Second operand 16 states. [2018-07-25 13:18:35,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:35,244 INFO L93 Difference]: Finished difference Result 1956 states and 3208 transitions. [2018-07-25 13:18:35,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:18:35,245 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-07-25 13:18:35,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:35,246 INFO L225 Difference]: With dead ends: 1956 [2018-07-25 13:18:35,246 INFO L226 Difference]: Without dead ends: 1955 [2018-07-25 13:18:35,247 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:18:35,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states. [2018-07-25 13:18:36,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1711. [2018-07-25 13:18:36,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1711 states. [2018-07-25 13:18:36,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2797 transitions. [2018-07-25 13:18:36,769 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2797 transitions. Word has length 23 [2018-07-25 13:18:36,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:36,769 INFO L472 AbstractCegarLoop]: Abstraction has 1711 states and 2797 transitions. [2018-07-25 13:18:36,769 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 13:18:36,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2797 transitions. [2018-07-25 13:18:36,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 13:18:36,770 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:36,770 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:36,770 INFO L415 AbstractCegarLoop]: === Iteration 145 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:36,770 INFO L82 PathProgramCache]: Analyzing trace with hash -451472211, now seen corresponding path program 2 times [2018-07-25 13:18:36,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:36,784 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:36,784 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:36,784 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:18:36,784 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:18:36,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:18:36,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:18:36,785 INFO L87 Difference]: Start difference. First operand 1711 states and 2797 transitions. Second operand 14 states. [2018-07-25 13:18:38,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:38,669 INFO L93 Difference]: Finished difference Result 1914 states and 3100 transitions. [2018-07-25 13:18:38,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:18:38,670 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-07-25 13:18:38,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:38,672 INFO L225 Difference]: With dead ends: 1914 [2018-07-25 13:18:38,672 INFO L226 Difference]: Without dead ends: 1912 [2018-07-25 13:18:38,673 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=193, Invalid=677, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:18:38,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2018-07-25 13:18:40,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1723. [2018-07-25 13:18:40,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2018-07-25 13:18:40,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2809 transitions. [2018-07-25 13:18:40,247 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2809 transitions. Word has length 23 [2018-07-25 13:18:40,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:40,247 INFO L472 AbstractCegarLoop]: Abstraction has 1723 states and 2809 transitions. [2018-07-25 13:18:40,247 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:18:40,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2809 transitions. [2018-07-25 13:18:40,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 13:18:40,248 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:40,249 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:40,249 INFO L415 AbstractCegarLoop]: === Iteration 146 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:40,249 INFO L82 PathProgramCache]: Analyzing trace with hash -590426441, now seen corresponding path program 2 times [2018-07-25 13:18:40,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:40,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:40,271 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:40,271 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 13:18:40,271 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 13:18:40,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 13:18:40,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:18:40,272 INFO L87 Difference]: Start difference. First operand 1723 states and 2809 transitions. Second operand 15 states. [2018-07-25 13:18:42,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:42,341 INFO L93 Difference]: Finished difference Result 1923 states and 3105 transitions. [2018-07-25 13:18:42,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 13:18:42,341 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2018-07-25 13:18:42,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:42,344 INFO L225 Difference]: With dead ends: 1923 [2018-07-25 13:18:42,344 INFO L226 Difference]: Without dead ends: 1921 [2018-07-25 13:18:42,345 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=238, Invalid=1094, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:18:42,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2018-07-25 13:18:43,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1745. [2018-07-25 13:18:43,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1745 states. [2018-07-25 13:18:43,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2845 transitions. [2018-07-25 13:18:43,959 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2845 transitions. Word has length 23 [2018-07-25 13:18:43,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:43,959 INFO L472 AbstractCegarLoop]: Abstraction has 1745 states and 2845 transitions. [2018-07-25 13:18:43,959 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 13:18:43,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2845 transitions. [2018-07-25 13:18:43,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 13:18:43,960 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:43,960 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:43,960 INFO L415 AbstractCegarLoop]: === Iteration 147 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:43,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1677111747, now seen corresponding path program 3 times [2018-07-25 13:18:43,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:43,976 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:43,976 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:43,976 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:18:43,976 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:18:43,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:18:43,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:18:43,977 INFO L87 Difference]: Start difference. First operand 1745 states and 2845 transitions. Second operand 14 states. [2018-07-25 13:18:46,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:46,259 INFO L93 Difference]: Finished difference Result 2195 states and 3566 transitions. [2018-07-25 13:18:46,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:18:46,259 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-07-25 13:18:46,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:46,261 INFO L225 Difference]: With dead ends: 2195 [2018-07-25 13:18:46,261 INFO L226 Difference]: Without dead ends: 2193 [2018-07-25 13:18:46,261 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=191, Invalid=679, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:18:46,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2193 states. [2018-07-25 13:18:47,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2193 to 1652. [2018-07-25 13:18:47,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1652 states. [2018-07-25 13:18:47,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 2691 transitions. [2018-07-25 13:18:47,842 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 2691 transitions. Word has length 23 [2018-07-25 13:18:47,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:47,842 INFO L472 AbstractCegarLoop]: Abstraction has 1652 states and 2691 transitions. [2018-07-25 13:18:47,842 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:18:47,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2691 transitions. [2018-07-25 13:18:47,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 13:18:47,843 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:47,843 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:47,843 INFO L415 AbstractCegarLoop]: === Iteration 148 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:47,843 INFO L82 PathProgramCache]: Analyzing trace with hash 170792271, now seen corresponding path program 2 times [2018-07-25 13:18:47,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:47,863 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:47,864 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:47,864 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 13:18:47,864 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 13:18:47,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 13:18:47,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:18:47,864 INFO L87 Difference]: Start difference. First operand 1652 states and 2691 transitions. Second operand 16 states. [2018-07-25 13:18:49,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:49,946 INFO L93 Difference]: Finished difference Result 1928 states and 3135 transitions. [2018-07-25 13:18:49,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:18:49,946 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-07-25 13:18:49,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:49,948 INFO L225 Difference]: With dead ends: 1928 [2018-07-25 13:18:49,948 INFO L226 Difference]: Without dead ends: 1927 [2018-07-25 13:18:49,949 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:18:49,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2018-07-25 13:18:51,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1651. [2018-07-25 13:18:51,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1651 states. [2018-07-25 13:18:51,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2684 transitions. [2018-07-25 13:18:51,629 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 2684 transitions. Word has length 23 [2018-07-25 13:18:51,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:51,629 INFO L472 AbstractCegarLoop]: Abstraction has 1651 states and 2684 transitions. [2018-07-25 13:18:51,629 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 13:18:51,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2684 transitions. [2018-07-25 13:18:51,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 13:18:51,630 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:51,630 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:51,630 INFO L415 AbstractCegarLoop]: === Iteration 149 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:51,630 INFO L82 PathProgramCache]: Analyzing trace with hash 170791983, now seen corresponding path program 4 times [2018-07-25 13:18:51,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:51,645 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:51,645 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:51,645 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:18:51,645 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:18:51,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:18:51,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:18:51,646 INFO L87 Difference]: Start difference. First operand 1651 states and 2684 transitions. Second operand 14 states. [2018-07-25 13:18:53,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:53,727 INFO L93 Difference]: Finished difference Result 1899 states and 3045 transitions. [2018-07-25 13:18:53,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:18:53,727 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-07-25 13:18:53,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:53,729 INFO L225 Difference]: With dead ends: 1899 [2018-07-25 13:18:53,729 INFO L226 Difference]: Without dead ends: 1897 [2018-07-25 13:18:53,730 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=214, Invalid=716, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:18:53,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2018-07-25 13:18:55,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1441. [2018-07-25 13:18:55,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1441 states. [2018-07-25 13:18:55,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 2333 transitions. [2018-07-25 13:18:55,321 INFO L78 Accepts]: Start accepts. Automaton has 1441 states and 2333 transitions. Word has length 23 [2018-07-25 13:18:55,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:55,321 INFO L472 AbstractCegarLoop]: Abstraction has 1441 states and 2333 transitions. [2018-07-25 13:18:55,321 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:18:55,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 2333 transitions. [2018-07-25 13:18:55,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 13:18:55,322 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:55,322 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-25 13:18:55,322 INFO L415 AbstractCegarLoop]: === Iteration 150 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:55,322 INFO L82 PathProgramCache]: Analyzing trace with hash 162203814, now seen corresponding path program 2 times [2018-07-25 13:18:55,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:55,341 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 13:18:55,341 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:55,342 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 13:18:55,342 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 13:18:55,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 13:18:55,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:18:55,342 INFO L87 Difference]: Start difference. First operand 1441 states and 2333 transitions. Second operand 15 states. [2018-07-25 13:18:57,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:57,390 INFO L93 Difference]: Finished difference Result 1620 states and 2601 transitions. [2018-07-25 13:18:57,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:18:57,390 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2018-07-25 13:18:57,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:57,392 INFO L225 Difference]: With dead ends: 1620 [2018-07-25 13:18:57,392 INFO L226 Difference]: Without dead ends: 1619 [2018-07-25 13:18:57,392 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=193, Invalid=677, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:18:57,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2018-07-25 13:18:59,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1439. [2018-07-25 13:18:59,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1439 states. [2018-07-25 13:18:59,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 2328 transitions. [2018-07-25 13:18:59,023 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 2328 transitions. Word has length 23 [2018-07-25 13:18:59,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:59,023 INFO L472 AbstractCegarLoop]: Abstraction has 1439 states and 2328 transitions. [2018-07-25 13:18:59,024 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 13:18:59,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 2328 transitions. [2018-07-25 13:18:59,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 13:18:59,025 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:59,025 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:59,025 INFO L415 AbstractCegarLoop]: === Iteration 151 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:59,025 INFO L82 PathProgramCache]: Analyzing trace with hash 162205096, now seen corresponding path program 2 times [2018-07-25 13:18:59,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:59,042 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:59,043 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:59,043 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:18:59,043 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:18:59,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:18:59,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:18:59,044 INFO L87 Difference]: Start difference. First operand 1439 states and 2328 transitions. Second operand 14 states. [2018-07-25 13:19:01,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:01,206 INFO L93 Difference]: Finished difference Result 1661 states and 2663 transitions. [2018-07-25 13:19:01,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:19:01,206 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-07-25 13:19:01,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:01,208 INFO L225 Difference]: With dead ends: 1661 [2018-07-25 13:19:01,208 INFO L226 Difference]: Without dead ends: 1659 [2018-07-25 13:19:01,209 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:19:01,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2018-07-25 13:19:02,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1441. [2018-07-25 13:19:02,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1441 states. [2018-07-25 13:19:02,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 2330 transitions. [2018-07-25 13:19:02,837 INFO L78 Accepts]: Start accepts. Automaton has 1441 states and 2330 transitions. Word has length 23 [2018-07-25 13:19:02,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:02,837 INFO L472 AbstractCegarLoop]: Abstraction has 1441 states and 2330 transitions. [2018-07-25 13:19:02,837 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:19:02,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 2330 transitions. [2018-07-25 13:19:02,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 13:19:02,838 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:02,838 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:19:02,839 INFO L415 AbstractCegarLoop]: === Iteration 152 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:02,839 INFO L82 PathProgramCache]: Analyzing trace with hash 208964473, now seen corresponding path program 2 times [2018-07-25 13:19:02,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:02,855 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:02,855 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:02,855 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 13:19:02,855 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 13:19:02,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 13:19:02,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:19:02,856 INFO L87 Difference]: Start difference. First operand 1441 states and 2330 transitions. Second operand 15 states. [2018-07-25 13:19:05,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:05,495 INFO L93 Difference]: Finished difference Result 2002 states and 3222 transitions. [2018-07-25 13:19:05,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 13:19:05,495 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2018-07-25 13:19:05,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:05,497 INFO L225 Difference]: With dead ends: 2002 [2018-07-25 13:19:05,497 INFO L226 Difference]: Without dead ends: 2000 [2018-07-25 13:19:05,498 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=255, Invalid=1227, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:19:05,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2018-07-25 13:19:07,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1602. [2018-07-25 13:19:07,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1602 states. [2018-07-25 13:19:07,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2591 transitions. [2018-07-25 13:19:07,375 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2591 transitions. Word has length 23 [2018-07-25 13:19:07,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:07,375 INFO L472 AbstractCegarLoop]: Abstraction has 1602 states and 2591 transitions. [2018-07-25 13:19:07,375 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 13:19:07,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2591 transitions. [2018-07-25 13:19:07,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 13:19:07,376 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:07,376 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:19:07,376 INFO L415 AbstractCegarLoop]: === Iteration 153 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:07,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1117815128, now seen corresponding path program 1 times [2018-07-25 13:19:07,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:07,393 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:07,393 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:07,393 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:19:07,393 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:19:07,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:19:07,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:19:07,394 INFO L87 Difference]: Start difference. First operand 1602 states and 2591 transitions. Second operand 13 states. [2018-07-25 13:19:09,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:09,826 INFO L93 Difference]: Finished difference Result 1864 states and 2997 transitions. [2018-07-25 13:19:09,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 13:19:09,827 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-07-25 13:19:09,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:09,829 INFO L225 Difference]: With dead ends: 1864 [2018-07-25 13:19:09,829 INFO L226 Difference]: Without dead ends: 1862 [2018-07-25 13:19:09,829 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=224, Invalid=1258, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:19:09,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2018-07-25 13:19:11,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1671. [2018-07-25 13:19:11,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1671 states. [2018-07-25 13:19:11,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2717 transitions. [2018-07-25 13:19:11,723 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2717 transitions. Word has length 23 [2018-07-25 13:19:11,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:11,723 INFO L472 AbstractCegarLoop]: Abstraction has 1671 states and 2717 transitions. [2018-07-25 13:19:11,723 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:19:11,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2717 transitions. [2018-07-25 13:19:11,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 13:19:11,724 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:11,724 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-25 13:19:11,725 INFO L415 AbstractCegarLoop]: === Iteration 154 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:11,725 INFO L82 PathProgramCache]: Analyzing trace with hash -821177279, now seen corresponding path program 2 times [2018-07-25 13:19:11,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:11,742 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:11,742 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:11,742 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 13:19:11,742 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 13:19:11,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 13:19:11,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:19:11,743 INFO L87 Difference]: Start difference. First operand 1671 states and 2717 transitions. Second operand 16 states. [2018-07-25 13:19:13,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:13,916 INFO L93 Difference]: Finished difference Result 1740 states and 2811 transitions. [2018-07-25 13:19:13,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-25 13:19:13,916 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-07-25 13:19:13,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:13,918 INFO L225 Difference]: With dead ends: 1740 [2018-07-25 13:19:13,918 INFO L226 Difference]: Without dead ends: 1739 [2018-07-25 13:19:13,918 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=373, Invalid=1697, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 13:19:13,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2018-07-25 13:19:15,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1613. [2018-07-25 13:19:15,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1613 states. [2018-07-25 13:19:15,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 2622 transitions. [2018-07-25 13:19:15,771 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 2622 transitions. Word has length 25 [2018-07-25 13:19:15,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:15,771 INFO L472 AbstractCegarLoop]: Abstraction has 1613 states and 2622 transitions. [2018-07-25 13:19:15,771 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 13:19:15,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2622 transitions. [2018-07-25 13:19:15,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 13:19:15,772 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:15,772 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:19:15,772 INFO L415 AbstractCegarLoop]: === Iteration 155 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:15,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1822640705, now seen corresponding path program 1 times [2018-07-25 13:19:15,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:15,794 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:15,794 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:15,794 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 13:19:15,794 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 13:19:15,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 13:19:15,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:19:15,795 INFO L87 Difference]: Start difference. First operand 1613 states and 2622 transitions. Second operand 15 states. [2018-07-25 13:19:17,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:17,996 INFO L93 Difference]: Finished difference Result 1786 states and 2897 transitions. [2018-07-25 13:19:17,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:19:17,997 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-07-25 13:19:17,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:17,998 INFO L225 Difference]: With dead ends: 1786 [2018-07-25 13:19:17,999 INFO L226 Difference]: Without dead ends: 1785 [2018-07-25 13:19:17,999 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:19:18,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2018-07-25 13:19:19,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1655. [2018-07-25 13:19:19,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1655 states. [2018-07-25 13:19:19,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2692 transitions. [2018-07-25 13:19:19,931 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2692 transitions. Word has length 25 [2018-07-25 13:19:19,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:19,931 INFO L472 AbstractCegarLoop]: Abstraction has 1655 states and 2692 transitions. [2018-07-25 13:19:19,931 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 13:19:19,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2692 transitions. [2018-07-25 13:19:19,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 13:19:19,932 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:19,932 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-25 13:19:19,932 INFO L415 AbstractCegarLoop]: === Iteration 156 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:19,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1372501011, now seen corresponding path program 3 times [2018-07-25 13:19:19,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:19,948 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:19,948 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:19,948 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 13:19:19,948 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 13:19:19,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 13:19:19,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:19:19,949 INFO L87 Difference]: Start difference. First operand 1655 states and 2692 transitions. Second operand 16 states. [2018-07-25 13:19:22,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:22,722 INFO L93 Difference]: Finished difference Result 2034 states and 3278 transitions. [2018-07-25 13:19:22,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-25 13:19:22,722 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-07-25 13:19:22,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:22,724 INFO L225 Difference]: With dead ends: 2034 [2018-07-25 13:19:22,725 INFO L226 Difference]: Without dead ends: 2033 [2018-07-25 13:19:22,725 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=473, Invalid=3187, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:19:22,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2018-07-25 13:19:24,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 1671. [2018-07-25 13:19:24,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1671 states. [2018-07-25 13:19:24,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2720 transitions. [2018-07-25 13:19:24,715 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2720 transitions. Word has length 25 [2018-07-25 13:19:24,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:24,715 INFO L472 AbstractCegarLoop]: Abstraction has 1671 states and 2720 transitions. [2018-07-25 13:19:24,715 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 13:19:24,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2720 transitions. [2018-07-25 13:19:24,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 13:19:24,716 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:24,716 INFO L354 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:19:24,717 INFO L415 AbstractCegarLoop]: === Iteration 157 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:24,717 INFO L82 PathProgramCache]: Analyzing trace with hash -532386214, now seen corresponding path program 6 times [2018-07-25 13:19:24,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:24,746 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:24,747 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:24,747 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 13:19:24,747 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 13:19:24,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 13:19:24,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:19:24,748 INFO L87 Difference]: Start difference. First operand 1671 states and 2720 transitions. Second operand 18 states. [2018-07-25 13:19:26,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:26,937 INFO L93 Difference]: Finished difference Result 1747 states and 2831 transitions. [2018-07-25 13:19:26,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 13:19:26,938 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2018-07-25 13:19:26,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:26,940 INFO L225 Difference]: With dead ends: 1747 [2018-07-25 13:19:26,940 INFO L226 Difference]: Without dead ends: 1746 [2018-07-25 13:19:26,940 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=265, Invalid=1217, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:19:26,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2018-07-25 13:19:28,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1673. [2018-07-25 13:19:28,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1673 states. [2018-07-25 13:19:28,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2721 transitions. [2018-07-25 13:19:28,937 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2721 transitions. Word has length 25 [2018-07-25 13:19:28,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:28,938 INFO L472 AbstractCegarLoop]: Abstraction has 1673 states and 2721 transitions. [2018-07-25 13:19:28,938 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 13:19:28,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2721 transitions. [2018-07-25 13:19:28,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 13:19:28,939 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:28,939 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:19:28,939 INFO L415 AbstractCegarLoop]: === Iteration 158 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:28,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1681122916, now seen corresponding path program 2 times [2018-07-25 13:19:28,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:28,959 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:28,959 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:28,959 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 13:19:28,959 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 13:19:28,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 13:19:28,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:19:28,960 INFO L87 Difference]: Start difference. First operand 1673 states and 2721 transitions. Second operand 17 states. [2018-07-25 13:19:31,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:31,525 INFO L93 Difference]: Finished difference Result 1789 states and 2888 transitions. [2018-07-25 13:19:31,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 13:19:31,525 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-07-25 13:19:31,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:31,527 INFO L225 Difference]: With dead ends: 1789 [2018-07-25 13:19:31,527 INFO L226 Difference]: Without dead ends: 1787 [2018-07-25 13:19:31,528 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=260, Invalid=1546, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:19:31,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2018-07-25 13:19:33,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1641. [2018-07-25 13:19:33,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1641 states. [2018-07-25 13:19:33,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2669 transitions. [2018-07-25 13:19:33,514 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2669 transitions. Word has length 25 [2018-07-25 13:19:33,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:33,514 INFO L472 AbstractCegarLoop]: Abstraction has 1641 states and 2669 transitions. [2018-07-25 13:19:33,514 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 13:19:33,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2669 transitions. [2018-07-25 13:19:33,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 13:19:33,515 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:33,515 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-25 13:19:33,515 INFO L415 AbstractCegarLoop]: === Iteration 159 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:33,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1832810091, now seen corresponding path program 4 times [2018-07-25 13:19:33,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:33,530 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:33,530 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:33,530 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 13:19:33,530 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 13:19:33,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 13:19:33,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:19:33,531 INFO L87 Difference]: Start difference. First operand 1641 states and 2669 transitions. Second operand 16 states. [2018-07-25 13:19:36,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:36,028 INFO L93 Difference]: Finished difference Result 1864 states and 3013 transitions. [2018-07-25 13:19:36,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 13:19:36,028 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-07-25 13:19:36,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:36,031 INFO L225 Difference]: With dead ends: 1864 [2018-07-25 13:19:36,031 INFO L226 Difference]: Without dead ends: 1862 [2018-07-25 13:19:36,031 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=330, Invalid=1562, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 13:19:36,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2018-07-25 13:19:38,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1610. [2018-07-25 13:19:38,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1610 states. [2018-07-25 13:19:38,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2618 transitions. [2018-07-25 13:19:38,006 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2618 transitions. Word has length 25 [2018-07-25 13:19:38,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:38,007 INFO L472 AbstractCegarLoop]: Abstraction has 1610 states and 2618 transitions. [2018-07-25 13:19:38,007 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 13:19:38,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2618 transitions. [2018-07-25 13:19:38,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 13:19:38,007 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:38,007 INFO L354 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:19:38,008 INFO L415 AbstractCegarLoop]: === Iteration 160 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:38,008 INFO L82 PathProgramCache]: Analyzing trace with hash -72077134, now seen corresponding path program 7 times [2018-07-25 13:19:38,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:38,037 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:38,037 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:38,037 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 13:19:38,037 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 13:19:38,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 13:19:38,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:19:38,038 INFO L87 Difference]: Start difference. First operand 1610 states and 2618 transitions. Second operand 18 states. [2018-07-25 13:19:40,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:40,421 INFO L93 Difference]: Finished difference Result 1778 states and 2887 transitions. [2018-07-25 13:19:40,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 13:19:40,421 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2018-07-25 13:19:40,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:40,423 INFO L225 Difference]: With dead ends: 1778 [2018-07-25 13:19:40,423 INFO L226 Difference]: Without dead ends: 1777 [2018-07-25 13:19:40,424 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=312, Invalid=1328, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:19:40,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2018-07-25 13:19:42,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1650. [2018-07-25 13:19:42,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1650 states. [2018-07-25 13:19:42,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 2682 transitions. [2018-07-25 13:19:42,436 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 2682 transitions. Word has length 25 [2018-07-25 13:19:42,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:42,436 INFO L472 AbstractCegarLoop]: Abstraction has 1650 states and 2682 transitions. [2018-07-25 13:19:42,437 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 13:19:42,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2682 transitions. [2018-07-25 13:19:42,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 13:19:42,437 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:42,438 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:19:42,438 INFO L415 AbstractCegarLoop]: === Iteration 161 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:42,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1741678744, now seen corresponding path program 3 times [2018-07-25 13:19:42,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:42,455 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:42,455 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:42,455 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 13:19:42,455 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 13:19:42,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 13:19:42,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:19:42,456 INFO L87 Difference]: Start difference. First operand 1650 states and 2682 transitions. Second operand 17 states. [2018-07-25 13:19:44,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:44,755 INFO L93 Difference]: Finished difference Result 1836 states and 2973 transitions. [2018-07-25 13:19:44,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:19:44,755 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-07-25 13:19:44,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:44,757 INFO L225 Difference]: With dead ends: 1836 [2018-07-25 13:19:44,757 INFO L226 Difference]: Without dead ends: 1835 [2018-07-25 13:19:44,758 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=209, Invalid=847, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:19:44,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2018-07-25 13:19:46,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1762. [2018-07-25 13:19:46,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1762 states. [2018-07-25 13:19:46,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 2868 transitions. [2018-07-25 13:19:46,926 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 2868 transitions. Word has length 25 [2018-07-25 13:19:46,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:46,926 INFO L472 AbstractCegarLoop]: Abstraction has 1762 states and 2868 transitions. [2018-07-25 13:19:46,926 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 13:19:46,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 2868 transitions. [2018-07-25 13:19:46,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 13:19:46,927 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:46,927 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:19:46,927 INFO L415 AbstractCegarLoop]: === Iteration 162 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:46,927 INFO L82 PathProgramCache]: Analyzing trace with hash -463321892, now seen corresponding path program 3 times [2018-07-25 13:19:46,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:46,948 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:46,948 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:46,948 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 13:19:46,948 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 13:19:46,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 13:19:46,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:19:46,949 INFO L87 Difference]: Start difference. First operand 1762 states and 2868 transitions. Second operand 17 states. [2018-07-25 13:19:50,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:50,007 INFO L93 Difference]: Finished difference Result 2066 states and 3329 transitions. [2018-07-25 13:19:50,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-25 13:19:50,007 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-07-25 13:19:50,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:50,010 INFO L225 Difference]: With dead ends: 2066 [2018-07-25 13:19:50,010 INFO L226 Difference]: Without dead ends: 2064 [2018-07-25 13:19:50,011 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=390, Invalid=2366, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:19:50,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2064 states. [2018-07-25 13:19:52,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2064 to 1772. [2018-07-25 13:19:52,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1772 states. [2018-07-25 13:19:52,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2884 transitions. [2018-07-25 13:19:52,283 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2884 transitions. Word has length 25 [2018-07-25 13:19:52,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:52,284 INFO L472 AbstractCegarLoop]: Abstraction has 1772 states and 2884 transitions. [2018-07-25 13:19:52,284 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 13:19:52,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2884 transitions. [2018-07-25 13:19:52,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 13:19:52,285 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:52,285 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:19:52,285 INFO L415 AbstractCegarLoop]: === Iteration 163 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:52,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1911500712, now seen corresponding path program 1 times [2018-07-25 13:19:52,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:52,300 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:52,300 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:52,300 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:19:52,301 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:19:52,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:19:52,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:19:52,301 INFO L87 Difference]: Start difference. First operand 1772 states and 2884 transitions. Second operand 14 states. [2018-07-25 13:19:54,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:54,879 INFO L93 Difference]: Finished difference Result 1956 states and 3171 transitions. [2018-07-25 13:19:54,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 13:19:54,879 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-07-25 13:19:54,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:54,881 INFO L225 Difference]: With dead ends: 1956 [2018-07-25 13:19:54,881 INFO L226 Difference]: Without dead ends: 1955 [2018-07-25 13:19:54,881 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=179, Invalid=877, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:19:54,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states. [2018-07-25 13:19:57,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1793. [2018-07-25 13:19:57,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1793 states. [2018-07-25 13:19:57,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2918 transitions. [2018-07-25 13:19:57,170 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2918 transitions. Word has length 25 [2018-07-25 13:19:57,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:57,170 INFO L472 AbstractCegarLoop]: Abstraction has 1793 states and 2918 transitions. [2018-07-25 13:19:57,170 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:19:57,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2918 transitions. [2018-07-25 13:19:57,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 13:19:57,171 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:57,171 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:19:57,172 INFO L415 AbstractCegarLoop]: === Iteration 164 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:57,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1586218584, now seen corresponding path program 1 times [2018-07-25 13:19:57,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:57,190 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:57,190 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:57,190 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 13:19:57,190 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 13:19:57,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 13:19:57,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:19:57,191 INFO L87 Difference]: Start difference. First operand 1793 states and 2918 transitions. Second operand 16 states. [2018-07-25 13:19:59,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:59,795 INFO L93 Difference]: Finished difference Result 1932 states and 3141 transitions. [2018-07-25 13:19:59,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:19:59,795 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-07-25 13:19:59,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:59,797 INFO L225 Difference]: With dead ends: 1932 [2018-07-25 13:19:59,797 INFO L226 Difference]: Without dead ends: 1931 [2018-07-25 13:19:59,798 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:19:59,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2018-07-25 13:20:02,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1891. [2018-07-25 13:20:02,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1891 states. [2018-07-25 13:20:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 3080 transitions. [2018-07-25 13:20:02,216 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 3080 transitions. Word has length 25 [2018-07-25 13:20:02,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:02,216 INFO L472 AbstractCegarLoop]: Abstraction has 1891 states and 3080 transitions. [2018-07-25 13:20:02,216 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 13:20:02,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 3080 transitions. [2018-07-25 13:20:02,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 13:20:02,217 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:02,217 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:20:02,218 INFO L415 AbstractCegarLoop]: === Iteration 165 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:02,218 INFO L82 PathProgramCache]: Analyzing trace with hash -209412774, now seen corresponding path program 1 times [2018-07-25 13:20:02,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:02,238 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:02,238 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:02,239 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:20:02,239 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:20:02,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:20:02,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:20:02,239 INFO L87 Difference]: Start difference. First operand 1891 states and 3080 transitions. Second operand 14 states. [2018-07-25 13:20:05,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:05,023 INFO L93 Difference]: Finished difference Result 2086 states and 3386 transitions. [2018-07-25 13:20:05,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 13:20:05,023 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-07-25 13:20:05,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:05,026 INFO L225 Difference]: With dead ends: 2086 [2018-07-25 13:20:05,026 INFO L226 Difference]: Without dead ends: 2085 [2018-07-25 13:20:05,027 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=186, Invalid=936, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:20:05,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2018-07-25 13:20:07,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 1866. [2018-07-25 13:20:07,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1866 states. [2018-07-25 13:20:07,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 3042 transitions. [2018-07-25 13:20:07,546 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 3042 transitions. Word has length 25 [2018-07-25 13:20:07,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:07,546 INFO L472 AbstractCegarLoop]: Abstraction has 1866 states and 3042 transitions. [2018-07-25 13:20:07,547 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:20:07,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 3042 transitions. [2018-07-25 13:20:07,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 13:20:07,548 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:07,548 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:20:07,548 INFO L415 AbstractCegarLoop]: === Iteration 166 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:07,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1006660774, now seen corresponding path program 1 times [2018-07-25 13:20:07,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:07,565 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:07,565 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:07,565 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 13:20:07,566 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 13:20:07,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 13:20:07,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:20:07,566 INFO L87 Difference]: Start difference. First operand 1866 states and 3042 transitions. Second operand 16 states. [2018-07-25 13:20:10,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:10,103 INFO L93 Difference]: Finished difference Result 1936 states and 3146 transitions. [2018-07-25 13:20:10,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:20:10,103 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-07-25 13:20:10,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:10,105 INFO L225 Difference]: With dead ends: 1936 [2018-07-25 13:20:10,105 INFO L226 Difference]: Without dead ends: 1935 [2018-07-25 13:20:10,106 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=189, Invalid=741, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:20:10,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2018-07-25 13:20:12,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1796. [2018-07-25 13:20:12,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1796 states. [2018-07-25 13:20:12,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2921 transitions. [2018-07-25 13:20:12,509 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2921 transitions. Word has length 25 [2018-07-25 13:20:12,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:12,509 INFO L472 AbstractCegarLoop]: Abstraction has 1796 states and 2921 transitions. [2018-07-25 13:20:12,509 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 13:20:12,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2921 transitions. [2018-07-25 13:20:12,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-25 13:20:12,510 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:12,510 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:20:12,510 INFO L415 AbstractCegarLoop]: === Iteration 167 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:12,510 INFO L82 PathProgramCache]: Analyzing trace with hash -624347648, now seen corresponding path program 3 times [2018-07-25 13:20:12,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:12,524 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-07-25 13:20:12,525 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:12,525 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:20:12,525 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:20:12,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:20:12,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:20:12,525 INFO L87 Difference]: Start difference. First operand 1796 states and 2921 transitions. Second operand 14 states. Received shutdown request... [2018-07-25 13:20:13,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:20:13,038 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 13:20:13,045 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 13:20:13,046 INFO L202 PluginConnector]: Adding new model threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:20:13 BoogieIcfgContainer [2018-07-25 13:20:13,046 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:20:13,047 INFO L168 Benchmark]: Toolchain (without parser) took 255680.83 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 872.4 MB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -752.1 MB). Peak memory consumption was 120.3 MB. Max. memory is 7.1 GB. [2018-07-25 13:20:13,050 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:20:13,050 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.44 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:20:13,050 INFO L168 Benchmark]: Boogie Preprocessor took 28.87 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:20:13,051 INFO L168 Benchmark]: RCFGBuilder took 318.38 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-25 13:20:13,051 INFO L168 Benchmark]: TraceAbstraction took 255285.43 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 872.4 MB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -762.7 MB). Peak memory consumption was 109.7 MB. Max. memory is 7.1 GB. [2018-07-25 13:20:13,061 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.44 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.87 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 318.38 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 255285.43 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 872.4 MB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -762.7 MB). Peak memory consumption was 109.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 94). Cancelled while BasicCegarLoop was constructing difference of abstraction (1796states) and interpolant automaton (currently 14 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (86 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 74). Cancelled while BasicCegarLoop was constructing difference of abstraction (1796states) and interpolant automaton (currently 14 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (86 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 45). Cancelled while BasicCegarLoop was constructing difference of abstraction (1796states) and interpolant automaton (currently 14 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (86 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 85). Cancelled while BasicCegarLoop was constructing difference of abstraction (1796states) and interpolant automaton (currently 14 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (86 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 4 error locations. TIMEOUT Result, 255.2s OverallTime, 167 OverallIterations, 4 TraceHistogramMax, 144.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6249 SDtfs, 16308 SDslu, 15939 SDs, 0 SdLazy, 95401 SolverSat, 6629 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 9.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3890 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 3740 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22132 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1891occurred in iteration=164, 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: 107.2s AutomataMinimizationTime, 166 MinimizatonAttempts, 15973 StatesRemovedByMinimization, 163 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2883 NumberOfCodeBlocks, 2883 NumberOfCodeBlocksAsserted, 167 NumberOfCheckSat, 2716 ConstructedInterpolants, 0 QuantifiedInterpolants, 299247 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 167 InterpolantComputations, 10 PerfectInterpolantSequences, 276/1493 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-20-13-079.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_13-20-13-079.csv Completed graceful shutdown