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_out.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:15:31,788 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:15:31,790 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:15:31,809 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:15:31,810 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:15:31,812 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:15:31,813 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:15:31,824 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:15:31,826 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:15:31,828 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:15:31,831 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:15:31,831 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:15:31,833 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:15:31,835 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:15:31,837 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:15:31,841 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:15:31,842 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:15:31,853 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:15:31,859 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:15:31,860 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:15:31,864 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:15:31,866 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:15:31,868 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:15:31,868 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:15:31,869 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:15:31,870 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:15:31,872 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:15:31,873 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:15:31,877 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:15:31,878 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:15:31,879 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:15:31,881 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:15:31,881 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:15:31,881 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:15:31,882 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:15:31,884 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:15:31,884 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:31,900 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:15:31,900 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:15:31,902 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:15:31,903 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:15:31,903 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:15:31,903 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:15:31,903 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:15:31,903 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:15:31,970 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:15:31,983 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:15:31,987 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:15:31,989 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:15:31,989 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:15:31,990 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl [2018-07-25 13:15:31,990 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl' [2018-07-25 13:15:32,098 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:15:32,100 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:15:32,101 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:15:32,101 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:15:32,101 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:15:32,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:32" (1/1) ... [2018-07-25 13:15:32,138 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:32" (1/1) ... [2018-07-25 13:15:32,148 WARN L165 Inliner]: Program contained no entry procedure! [2018-07-25 13:15:32,148 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-07-25 13:15:32,148 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-07-25 13:15:32,150 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:15:32,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:15:32,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:15:32,152 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:15:32,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:32" (1/1) ... [2018-07-25 13:15:32,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:32" (1/1) ... [2018-07-25 13:15:32,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:32" (1/1) ... [2018-07-25 13:15:32,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:32" (1/1) ... [2018-07-25 13:15:32,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:32" (1/1) ... [2018-07-25 13:15:32,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:32" (1/1) ... [2018-07-25 13:15:32,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:32" (1/1) ... [2018-07-25 13:15:32,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:15:32,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:15:32,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:15:32,210 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:15:32,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:32" (1/1) ... [2018-07-25 13:15:32,299 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-07-25 13:15:32,300 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-07-25 13:15:32,300 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-07-25 13:15:32,571 INFO L270 CfgBuilder]: Using library mode [2018-07-25 13:15:32,572 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:15:32 BoogieIcfgContainer [2018-07-25 13:15:32,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:15:32,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:15:32,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:15:32,578 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:15:32,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:32" (1/2) ... [2018-07-25 13:15:32,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d4b93ad and model type threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:15:32, skipping insertion in model container [2018-07-25 13:15:32,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:15:32" (2/2) ... [2018-07-25 13:15:32,582 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out.bpl [2018-07-25 13:15:32,592 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:15:32,601 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-07-25 13:15:32,652 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:15:32,653 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:15:32,654 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:15:32,654 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:15:32,654 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:15:32,654 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:15:32,654 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:15:32,655 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:15:32,655 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:15:32,676 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-07-25 13:15:32,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:15:32,686 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:32,687 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:32,689 INFO L415 AbstractCegarLoop]: === Iteration 1 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:32,695 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-07-25 13:15:32,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:32,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:32,830 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:32,831 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-25 13:15:32,836 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:15:32,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:15:32,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:15:32,852 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-07-25 13:15:33,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:33,470 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-07-25 13:15:33,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 13:15:33,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-07-25 13:15:33,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:33,490 INFO L225 Difference]: With dead ends: 163 [2018-07-25 13:15:33,490 INFO L226 Difference]: Without dead ends: 158 [2018-07-25 13:15:33,494 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:15:33,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-07-25 13:15:33,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-07-25 13:15:33,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-25 13:15:33,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-07-25 13:15:33,555 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-07-25 13:15:33,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:33,556 INFO L472 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-07-25 13:15:33,556 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:15:33,556 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-07-25 13:15:33,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:15:33,558 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:33,558 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:33,559 INFO L415 AbstractCegarLoop]: === Iteration 2 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:33,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-07-25 13:15:33,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:33,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:33,574 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:33,575 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-25 13:15:33,576 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:15:33,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:15:33,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:15:33,577 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-07-25 13:15:33,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:33,923 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-07-25 13:15:33,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 13:15:33,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-07-25 13:15:33,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:33,938 INFO L225 Difference]: With dead ends: 188 [2018-07-25 13:15:33,939 INFO L226 Difference]: Without dead ends: 183 [2018-07-25 13:15:33,940 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:15:33,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-25 13:15:33,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-07-25 13:15:33,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-07-25 13:15:33,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-07-25 13:15:33,990 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-07-25 13:15:33,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:33,994 INFO L472 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-07-25 13:15:33,994 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:15:33,994 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-07-25 13:15:33,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 13:15:33,996 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:33,997 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:33,999 INFO L415 AbstractCegarLoop]: === Iteration 3 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:34,000 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-07-25 13:15:34,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:34,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:34,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:34,036 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:34,036 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:15:34,036 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:34,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:34,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:34,037 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-07-25 13:15:34,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:34,377 INFO L93 Difference]: Finished difference Result 361 states and 808 transitions. [2018-07-25 13:15:34,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:15:34,378 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-07-25 13:15:34,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:34,382 INFO L225 Difference]: With dead ends: 361 [2018-07-25 13:15:34,382 INFO L226 Difference]: Without dead ends: 349 [2018-07-25 13:15:34,383 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:15:34,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-07-25 13:15:34,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 174. [2018-07-25 13:15:34,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-07-25 13:15:34,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 387 transitions. [2018-07-25 13:15:34,430 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 387 transitions. Word has length 9 [2018-07-25 13:15:34,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:34,430 INFO L472 AbstractCegarLoop]: Abstraction has 174 states and 387 transitions. [2018-07-25 13:15:34,431 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:34,431 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 387 transitions. [2018-07-25 13:15:34,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 13:15:34,432 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:34,432 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:34,433 INFO L415 AbstractCegarLoop]: === Iteration 4 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:34,434 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-07-25 13:15:34,434 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:34,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:34,452 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:34,452 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:15:34,455 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:34,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:34,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:34,457 INFO L87 Difference]: Start difference. First operand 174 states and 387 transitions. Second operand 7 states. [2018-07-25 13:15:34,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:34,742 INFO L93 Difference]: Finished difference Result 307 states and 694 transitions. [2018-07-25 13:15:34,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:15:34,742 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-07-25 13:15:34,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:34,745 INFO L225 Difference]: With dead ends: 307 [2018-07-25 13:15:34,745 INFO L226 Difference]: Without dead ends: 302 [2018-07-25 13:15:34,747 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:15:34,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-07-25 13:15:34,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 203. [2018-07-25 13:15:34,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-25 13:15:34,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-07-25 13:15:34,788 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-07-25 13:15:34,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:34,789 INFO L472 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-07-25 13:15:34,789 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:34,789 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-07-25 13:15:34,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:15:34,791 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:34,791 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:34,793 INFO L415 AbstractCegarLoop]: === Iteration 5 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:34,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-07-25 13:15:34,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:34,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:34,819 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:34,819 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:15:34,819 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:15:34,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:15:34,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:15:34,820 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 8 states. [2018-07-25 13:15:35,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:35,645 INFO L93 Difference]: Finished difference Result 741 states and 1656 transitions. [2018-07-25 13:15:35,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 13:15:35,645 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-25 13:15:35,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:35,652 INFO L225 Difference]: With dead ends: 741 [2018-07-25 13:15:35,653 INFO L226 Difference]: Without dead ends: 733 [2018-07-25 13:15:35,655 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:15:35,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-07-25 13:15:35,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 315. [2018-07-25 13:15:35,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-07-25 13:15:35,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 743 transitions. [2018-07-25 13:15:35,752 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 743 transitions. Word has length 12 [2018-07-25 13:15:35,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:35,752 INFO L472 AbstractCegarLoop]: Abstraction has 315 states and 743 transitions. [2018-07-25 13:15:35,752 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:15:35,753 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 743 transitions. [2018-07-25 13:15:35,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:15:35,759 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:35,759 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:35,762 INFO L415 AbstractCegarLoop]: === Iteration 6 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:35,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-07-25 13:15:35,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:35,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:35,784 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:35,784 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:15:35,784 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:15:35,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:15:35,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:15:35,785 INFO L87 Difference]: Start difference. First operand 315 states and 743 transitions. Second operand 8 states. [2018-07-25 13:15:36,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:36,597 INFO L93 Difference]: Finished difference Result 797 states and 1784 transitions. [2018-07-25 13:15:36,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 13:15:36,597 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-25 13:15:36,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:36,603 INFO L225 Difference]: With dead ends: 797 [2018-07-25 13:15:36,604 INFO L226 Difference]: Without dead ends: 789 [2018-07-25 13:15:36,606 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:15:36,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-07-25 13:15:36,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 319. [2018-07-25 13:15:36,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-07-25 13:15:36,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 751 transitions. [2018-07-25 13:15:36,700 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 751 transitions. Word has length 12 [2018-07-25 13:15:36,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:36,700 INFO L472 AbstractCegarLoop]: Abstraction has 319 states and 751 transitions. [2018-07-25 13:15:36,701 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:15:36,701 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 751 transitions. [2018-07-25 13:15:36,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:15:36,702 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:36,703 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:36,703 INFO L415 AbstractCegarLoop]: === Iteration 7 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:36,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-07-25 13:15:36,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:36,722 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:36,722 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:36,723 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:15:36,723 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:15:36,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:15:36,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:15:36,724 INFO L87 Difference]: Start difference. First operand 319 states and 751 transitions. Second operand 8 states. [2018-07-25 13:15:37,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:37,473 INFO L93 Difference]: Finished difference Result 684 states and 1538 transitions. [2018-07-25 13:15:37,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:15:37,474 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-25 13:15:37,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:37,479 INFO L225 Difference]: With dead ends: 684 [2018-07-25 13:15:37,479 INFO L226 Difference]: Without dead ends: 676 [2018-07-25 13:15:37,480 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:15:37,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-07-25 13:15:37,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 330. [2018-07-25 13:15:37,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-07-25 13:15:37,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 778 transitions. [2018-07-25 13:15:37,582 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 778 transitions. Word has length 12 [2018-07-25 13:15:37,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:37,583 INFO L472 AbstractCegarLoop]: Abstraction has 330 states and 778 transitions. [2018-07-25 13:15:37,583 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:15:37,583 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 778 transitions. [2018-07-25 13:15:37,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:15:37,584 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:37,586 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:37,587 INFO L415 AbstractCegarLoop]: === Iteration 8 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:37,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-07-25 13:15:37,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:37,607 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:37,608 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:37,608 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:15:37,609 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:15:37,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:15:37,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:15:37,611 INFO L87 Difference]: Start difference. First operand 330 states and 778 transitions. Second operand 8 states. [2018-07-25 13:15:38,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:38,150 INFO L93 Difference]: Finished difference Result 605 states and 1360 transitions. [2018-07-25 13:15:38,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:15:38,151 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-25 13:15:38,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:38,155 INFO L225 Difference]: With dead ends: 605 [2018-07-25 13:15:38,155 INFO L226 Difference]: Without dead ends: 597 [2018-07-25 13:15:38,156 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:15:38,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-07-25 13:15:38,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 337. [2018-07-25 13:15:38,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-07-25 13:15:38,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 794 transitions. [2018-07-25 13:15:38,256 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 794 transitions. Word has length 12 [2018-07-25 13:15:38,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:38,258 INFO L472 AbstractCegarLoop]: Abstraction has 337 states and 794 transitions. [2018-07-25 13:15:38,259 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:15:38,259 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 794 transitions. [2018-07-25 13:15:38,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:15:38,260 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:38,260 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:38,261 INFO L415 AbstractCegarLoop]: === Iteration 9 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:38,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1088621469, now seen corresponding path program 1 times [2018-07-25 13:15:38,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:38,278 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:38,279 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:38,279 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:15:38,280 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:15:38,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:15:38,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:15:38,281 INFO L87 Difference]: Start difference. First operand 337 states and 794 transitions. Second operand 8 states. [2018-07-25 13:15:39,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:39,101 INFO L93 Difference]: Finished difference Result 935 states and 2104 transitions. [2018-07-25 13:15:39,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:15:39,101 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-25 13:15:39,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:39,108 INFO L225 Difference]: With dead ends: 935 [2018-07-25 13:15:39,108 INFO L226 Difference]: Without dead ends: 927 [2018-07-25 13:15:39,110 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:15:39,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-07-25 13:15:39,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 343. [2018-07-25 13:15:39,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-07-25 13:15:39,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 808 transitions. [2018-07-25 13:15:39,231 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 808 transitions. Word has length 12 [2018-07-25 13:15:39,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:39,232 INFO L472 AbstractCegarLoop]: Abstraction has 343 states and 808 transitions. [2018-07-25 13:15:39,232 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:15:39,232 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 808 transitions. [2018-07-25 13:15:39,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:15:39,233 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:39,233 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:39,234 INFO L415 AbstractCegarLoop]: === Iteration 10 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:39,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1085821115, now seen corresponding path program 1 times [2018-07-25 13:15:39,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:39,254 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:39,255 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:39,255 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:15:39,256 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:15:39,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:15:39,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:15:39,256 INFO L87 Difference]: Start difference. First operand 343 states and 808 transitions. Second operand 8 states. [2018-07-25 13:15:40,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:40,116 INFO L93 Difference]: Finished difference Result 923 states and 2061 transitions. [2018-07-25 13:15:40,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:15:40,117 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-25 13:15:40,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:40,123 INFO L225 Difference]: With dead ends: 923 [2018-07-25 13:15:40,123 INFO L226 Difference]: Without dead ends: 915 [2018-07-25 13:15:40,124 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:15:40,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-07-25 13:15:40,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 354. [2018-07-25 13:15:40,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-07-25 13:15:40,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 835 transitions. [2018-07-25 13:15:40,261 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 835 transitions. Word has length 12 [2018-07-25 13:15:40,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:40,261 INFO L472 AbstractCegarLoop]: Abstraction has 354 states and 835 transitions. [2018-07-25 13:15:40,262 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:15:40,262 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 835 transitions. [2018-07-25 13:15:40,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:15:40,263 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:40,263 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:40,264 INFO L415 AbstractCegarLoop]: === Iteration 11 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:40,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1085923260, now seen corresponding path program 1 times [2018-07-25 13:15:40,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:40,279 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:40,279 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:40,279 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:15:40,280 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:15:40,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:15:40,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:15:40,281 INFO L87 Difference]: Start difference. First operand 354 states and 835 transitions. Second operand 8 states. [2018-07-25 13:15:41,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:41,051 INFO L93 Difference]: Finished difference Result 837 states and 1868 transitions. [2018-07-25 13:15:41,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:15:41,051 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-25 13:15:41,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:41,057 INFO L225 Difference]: With dead ends: 837 [2018-07-25 13:15:41,057 INFO L226 Difference]: Without dead ends: 829 [2018-07-25 13:15:41,059 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:15:41,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-07-25 13:15:41,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 339. [2018-07-25 13:15:41,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-07-25 13:15:41,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 800 transitions. [2018-07-25 13:15:41,185 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 800 transitions. Word has length 12 [2018-07-25 13:15:41,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:41,185 INFO L472 AbstractCegarLoop]: Abstraction has 339 states and 800 transitions. [2018-07-25 13:15:41,185 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:15:41,185 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 800 transitions. [2018-07-25 13:15:41,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:15:41,186 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:41,187 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:41,187 INFO L415 AbstractCegarLoop]: === Iteration 12 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:41,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1383194877, now seen corresponding path program 1 times [2018-07-25 13:15:41,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:41,200 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:41,201 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:41,201 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:15:41,201 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:15:41,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:15:41,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:15:41,202 INFO L87 Difference]: Start difference. First operand 339 states and 800 transitions. Second operand 8 states. [2018-07-25 13:15:42,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:42,121 INFO L93 Difference]: Finished difference Result 996 states and 2227 transitions. [2018-07-25 13:15:42,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 13:15:42,122 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-25 13:15:42,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:42,129 INFO L225 Difference]: With dead ends: 996 [2018-07-25 13:15:42,130 INFO L226 Difference]: Without dead ends: 988 [2018-07-25 13:15:42,132 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:15:42,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-07-25 13:15:42,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 381. [2018-07-25 13:15:42,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-07-25 13:15:42,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-07-25 13:15:42,303 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-07-25 13:15:42,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:42,305 INFO L472 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-07-25 13:15:42,305 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:15:42,307 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-07-25 13:15:42,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:15:42,308 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:42,309 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:42,309 INFO L415 AbstractCegarLoop]: === Iteration 13 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:42,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1383297022, now seen corresponding path program 1 times [2018-07-25 13:15:42,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:42,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:42,327 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:42,327 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:42,327 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:15:42,327 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:15:42,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:15:42,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:15:42,328 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-07-25 13:15:43,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:43,203 INFO L93 Difference]: Finished difference Result 913 states and 2034 transitions. [2018-07-25 13:15:43,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 13:15:43,203 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-25 13:15:43,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:43,210 INFO L225 Difference]: With dead ends: 913 [2018-07-25 13:15:43,210 INFO L226 Difference]: Without dead ends: 905 [2018-07-25 13:15:43,213 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:15:43,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-07-25 13:15:43,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 371. [2018-07-25 13:15:43,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-07-25 13:15:43,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 890 transitions. [2018-07-25 13:15:43,400 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 890 transitions. Word has length 12 [2018-07-25 13:15:43,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:43,400 INFO L472 AbstractCegarLoop]: Abstraction has 371 states and 890 transitions. [2018-07-25 13:15:43,400 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:15:43,400 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 890 transitions. [2018-07-25 13:15:43,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:15:43,401 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:43,402 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:43,402 INFO L415 AbstractCegarLoop]: === Iteration 14 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:43,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1392211258, now seen corresponding path program 1 times [2018-07-25 13:15:43,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:43,426 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:43,427 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:43,427 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:15:43,427 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:15:43,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:15:43,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:15:43,428 INFO L87 Difference]: Start difference. First operand 371 states and 890 transitions. Second operand 8 states. [2018-07-25 13:15:44,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:44,293 INFO L93 Difference]: Finished difference Result 886 states and 2009 transitions. [2018-07-25 13:15:44,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:15:44,294 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-25 13:15:44,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:44,300 INFO L225 Difference]: With dead ends: 886 [2018-07-25 13:15:44,300 INFO L226 Difference]: Without dead ends: 878 [2018-07-25 13:15:44,301 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:15:44,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2018-07-25 13:15:44,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 372. [2018-07-25 13:15:44,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-07-25 13:15:44,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 891 transitions. [2018-07-25 13:15:44,538 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 891 transitions. Word has length 12 [2018-07-25 13:15:44,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:44,538 INFO L472 AbstractCegarLoop]: Abstraction has 372 states and 891 transitions. [2018-07-25 13:15:44,539 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:15:44,539 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 891 transitions. [2018-07-25 13:15:44,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:15:44,539 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:44,540 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:44,540 INFO L415 AbstractCegarLoop]: === Iteration 15 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:44,540 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-07-25 13:15:44,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:44,562 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:44,563 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:44,563 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:15:44,563 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:15:44,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:15:44,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:15:44,564 INFO L87 Difference]: Start difference. First operand 372 states and 891 transitions. Second operand 9 states. [2018-07-25 13:15:45,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:45,474 INFO L93 Difference]: Finished difference Result 801 states and 1838 transitions. [2018-07-25 13:15:45,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 13:15:45,475 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-25 13:15:45,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:45,480 INFO L225 Difference]: With dead ends: 801 [2018-07-25 13:15:45,480 INFO L226 Difference]: Without dead ends: 793 [2018-07-25 13:15:45,484 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:15:45,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-07-25 13:15:45,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 393. [2018-07-25 13:15:45,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-07-25 13:15:45,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 949 transitions. [2018-07-25 13:15:45,721 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 949 transitions. Word has length 12 [2018-07-25 13:15:45,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:45,722 INFO L472 AbstractCegarLoop]: Abstraction has 393 states and 949 transitions. [2018-07-25 13:15:45,722 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:15:45,722 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 949 transitions. [2018-07-25 13:15:45,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:15:45,723 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:45,723 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:45,723 INFO L415 AbstractCegarLoop]: === Iteration 16 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:45,724 INFO L82 PathProgramCache]: Analyzing trace with hash 192619318, now seen corresponding path program 1 times [2018-07-25 13:15:45,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:45,743 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:45,743 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:45,744 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:15:45,744 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:15:45,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:15:45,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:15:45,745 INFO L87 Difference]: Start difference. First operand 393 states and 949 transitions. Second operand 9 states. [2018-07-25 13:15:46,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:46,892 INFO L93 Difference]: Finished difference Result 962 states and 2211 transitions. [2018-07-25 13:15:46,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:15:46,893 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-25 13:15:46,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:46,900 INFO L225 Difference]: With dead ends: 962 [2018-07-25 13:15:46,900 INFO L226 Difference]: Without dead ends: 954 [2018-07-25 13:15:46,901 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:15:46,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-07-25 13:15:47,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 409. [2018-07-25 13:15:47,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-07-25 13:15:47,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 997 transitions. [2018-07-25 13:15:47,153 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 997 transitions. Word has length 12 [2018-07-25 13:15:47,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:47,153 INFO L472 AbstractCegarLoop]: Abstraction has 409 states and 997 transitions. [2018-07-25 13:15:47,154 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:15:47,154 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 997 transitions. [2018-07-25 13:15:47,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:15:47,155 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:47,155 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:47,156 INFO L415 AbstractCegarLoop]: === Iteration 17 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:47,156 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-07-25 13:15:47,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:47,170 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:47,171 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:47,171 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:15:47,171 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:15:47,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:15:47,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:15:47,172 INFO L87 Difference]: Start difference. First operand 409 states and 997 transitions. Second operand 9 states. [2018-07-25 13:15:48,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:48,423 INFO L93 Difference]: Finished difference Result 1000 states and 2329 transitions. [2018-07-25 13:15:48,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:15:48,423 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-25 13:15:48,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:48,430 INFO L225 Difference]: With dead ends: 1000 [2018-07-25 13:15:48,430 INFO L226 Difference]: Without dead ends: 992 [2018-07-25 13:15:48,431 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:15:48,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-07-25 13:15:48,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 430. [2018-07-25 13:15:48,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-07-25 13:15:48,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1052 transitions. [2018-07-25 13:15:48,749 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1052 transitions. Word has length 12 [2018-07-25 13:15:48,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:48,749 INFO L472 AbstractCegarLoop]: Abstraction has 430 states and 1052 transitions. [2018-07-25 13:15:48,750 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:15:48,750 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1052 transitions. [2018-07-25 13:15:48,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:15:48,751 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:48,751 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:48,751 INFO L415 AbstractCegarLoop]: === Iteration 18 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:48,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1320238459, now seen corresponding path program 1 times [2018-07-25 13:15:48,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:48,762 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:48,762 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:48,762 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:15:48,763 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:15:48,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:15:48,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:15:48,764 INFO L87 Difference]: Start difference. First operand 430 states and 1052 transitions. Second operand 9 states. [2018-07-25 13:15:50,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:50,104 INFO L93 Difference]: Finished difference Result 1065 states and 2466 transitions. [2018-07-25 13:15:50,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 13:15:50,104 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-25 13:15:50,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:50,111 INFO L225 Difference]: With dead ends: 1065 [2018-07-25 13:15:50,111 INFO L226 Difference]: Without dead ends: 1057 [2018-07-25 13:15:50,112 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:15:50,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2018-07-25 13:15:50,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 471. [2018-07-25 13:15:50,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-07-25 13:15:50,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1168 transitions. [2018-07-25 13:15:50,455 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1168 transitions. Word has length 12 [2018-07-25 13:15:50,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:50,456 INFO L472 AbstractCegarLoop]: Abstraction has 471 states and 1168 transitions. [2018-07-25 13:15:50,456 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:15:50,456 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1168 transitions. [2018-07-25 13:15:50,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:15:50,457 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:50,457 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:50,458 INFO L415 AbstractCegarLoop]: === Iteration 19 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:50,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1320340604, now seen corresponding path program 1 times [2018-07-25 13:15:50,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:50,469 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:50,469 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:50,470 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:15:50,470 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:15:50,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:15:50,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:15:50,471 INFO L87 Difference]: Start difference. First operand 471 states and 1168 transitions. Second operand 9 states. [2018-07-25 13:15:52,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:52,160 INFO L93 Difference]: Finished difference Result 1227 states and 2851 transitions. [2018-07-25 13:15:52,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 13:15:52,160 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-25 13:15:52,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:52,167 INFO L225 Difference]: With dead ends: 1227 [2018-07-25 13:15:52,167 INFO L226 Difference]: Without dead ends: 1219 [2018-07-25 13:15:52,168 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=365, Invalid=967, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:15:52,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-07-25 13:15:52,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 438. [2018-07-25 13:15:52,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-07-25 13:15:52,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1072 transitions. [2018-07-25 13:15:52,508 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1072 transitions. Word has length 12 [2018-07-25 13:15:52,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:52,513 INFO L472 AbstractCegarLoop]: Abstraction has 438 states and 1072 transitions. [2018-07-25 13:15:52,513 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:15:52,513 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1072 transitions. [2018-07-25 13:15:52,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:15:52,514 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:52,515 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:52,515 INFO L415 AbstractCegarLoop]: === Iteration 20 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:52,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-07-25 13:15:52,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:52,532 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:52,532 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:52,532 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:15:52,532 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:15:52,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:15:52,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:15:52,533 INFO L87 Difference]: Start difference. First operand 438 states and 1072 transitions. Second operand 9 states. [2018-07-25 13:15:54,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:54,082 INFO L93 Difference]: Finished difference Result 1076 states and 2511 transitions. [2018-07-25 13:15:54,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 13:15:54,083 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-25 13:15:54,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:54,089 INFO L225 Difference]: With dead ends: 1076 [2018-07-25 13:15:54,090 INFO L226 Difference]: Without dead ends: 1068 [2018-07-25 13:15:54,091 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:15:54,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2018-07-25 13:15:54,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 445. [2018-07-25 13:15:54,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-07-25 13:15:54,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1088 transitions. [2018-07-25 13:15:54,513 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1088 transitions. Word has length 12 [2018-07-25 13:15:54,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:54,513 INFO L472 AbstractCegarLoop]: Abstraction has 445 states and 1088 transitions. [2018-07-25 13:15:54,514 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:15:54,514 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1088 transitions. [2018-07-25 13:15:54,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:15:54,515 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:54,515 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:54,515 INFO L415 AbstractCegarLoop]: === Iteration 21 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:54,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1838990990, now seen corresponding path program 1 times [2018-07-25 13:15:54,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:54,530 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:54,531 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:54,531 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:15:54,531 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:15:54,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:15:54,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:15:54,532 INFO L87 Difference]: Start difference. First operand 445 states and 1088 transitions. Second operand 9 states. [2018-07-25 13:15:56,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:56,205 INFO L93 Difference]: Finished difference Result 1111 states and 2606 transitions. [2018-07-25 13:15:56,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:15:56,205 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-25 13:15:56,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:56,212 INFO L225 Difference]: With dead ends: 1111 [2018-07-25 13:15:56,212 INFO L226 Difference]: Without dead ends: 1103 [2018-07-25 13:15:56,213 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:15:56,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2018-07-25 13:15:56,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 520. [2018-07-25 13:15:56,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-07-25 13:15:56,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1295 transitions. [2018-07-25 13:15:56,748 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1295 transitions. Word has length 12 [2018-07-25 13:15:56,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:56,748 INFO L472 AbstractCegarLoop]: Abstraction has 520 states and 1295 transitions. [2018-07-25 13:15:56,748 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:15:56,748 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1295 transitions. [2018-07-25 13:15:56,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:15:56,749 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:56,749 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:56,750 INFO L415 AbstractCegarLoop]: === Iteration 22 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:56,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1838888845, now seen corresponding path program 1 times [2018-07-25 13:15:56,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:56,763 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:56,763 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:56,763 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:15:56,763 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:15:56,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:15:56,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:15:56,764 INFO L87 Difference]: Start difference. First operand 520 states and 1295 transitions. Second operand 9 states. [2018-07-25 13:15:58,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:58,274 INFO L93 Difference]: Finished difference Result 1304 states and 3059 transitions. [2018-07-25 13:15:58,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:15:58,274 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-25 13:15:58,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:58,282 INFO L225 Difference]: With dead ends: 1304 [2018-07-25 13:15:58,282 INFO L226 Difference]: Without dead ends: 1296 [2018-07-25 13:15:58,283 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:15:58,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-07-25 13:15:58,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 487. [2018-07-25 13:15:58,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-07-25 13:15:58,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1199 transitions. [2018-07-25 13:15:58,749 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1199 transitions. Word has length 12 [2018-07-25 13:15:58,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:58,750 INFO L472 AbstractCegarLoop]: Abstraction has 487 states and 1199 transitions. [2018-07-25 13:15:58,750 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:15:58,750 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1199 transitions. [2018-07-25 13:15:58,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:15:58,750 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:58,751 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:15:58,751 INFO L415 AbstractCegarLoop]: === Iteration 23 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:58,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1731038698, now seen corresponding path program 1 times [2018-07-25 13:15:58,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:58,759 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,760 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:58,760 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:15:58,760 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:15:58,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:15:58,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:15:58,761 INFO L87 Difference]: Start difference. First operand 487 states and 1199 transitions. Second operand 9 states. [2018-07-25 13:16:00,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:00,249 INFO L93 Difference]: Finished difference Result 1370 states and 3217 transitions. [2018-07-25 13:16:00,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:16:00,250 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-25 13:16:00,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:00,257 INFO L225 Difference]: With dead ends: 1370 [2018-07-25 13:16:00,258 INFO L226 Difference]: Without dead ends: 1362 [2018-07-25 13:16:00,259 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=261, Invalid=609, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:16:00,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2018-07-25 13:16:00,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 479. [2018-07-25 13:16:00,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-07-25 13:16:00,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1179 transitions. [2018-07-25 13:16:00,665 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1179 transitions. Word has length 12 [2018-07-25 13:16:00,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:00,665 INFO L472 AbstractCegarLoop]: Abstraction has 479 states and 1179 transitions. [2018-07-25 13:16:00,666 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:00,666 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1179 transitions. [2018-07-25 13:16:00,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:16:00,666 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:00,667 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:00,667 INFO L415 AbstractCegarLoop]: === Iteration 24 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:00,667 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-07-25 13:16:00,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:00,679 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:00,679 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:00,679 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:16:00,680 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:00,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:00,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:00,680 INFO L87 Difference]: Start difference. First operand 479 states and 1179 transitions. Second operand 9 states. [2018-07-25 13:16:01,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:01,920 INFO L93 Difference]: Finished difference Result 1298 states and 3068 transitions. [2018-07-25 13:16:01,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 13:16:01,921 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-25 13:16:01,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:01,927 INFO L225 Difference]: With dead ends: 1298 [2018-07-25 13:16:01,927 INFO L226 Difference]: Without dead ends: 1290 [2018-07-25 13:16:01,928 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:16:01,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-07-25 13:16:02,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 602. [2018-07-25 13:16:02,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-07-25 13:16:02,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-07-25 13:16:02,491 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-07-25 13:16:02,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:02,491 INFO L472 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-07-25 13:16:02,491 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:02,492 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-07-25 13:16:02,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:16:02,492 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:02,493 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:02,493 INFO L415 AbstractCegarLoop]: === Iteration 25 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:02,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1080362888, now seen corresponding path program 1 times [2018-07-25 13:16:02,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:02,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:02,499 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:02,499 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-25 13:16:02,499 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:16:02,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:16:02,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:16:02,500 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-07-25 13:16:03,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:03,050 INFO L93 Difference]: Finished difference Result 1242 states and 3091 transitions. [2018-07-25 13:16:03,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:16:03,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-07-25 13:16:03,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:03,053 INFO L225 Difference]: With dead ends: 1242 [2018-07-25 13:16:03,053 INFO L226 Difference]: Without dead ends: 673 [2018-07-25 13:16:03,055 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:03,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-07-25 13:16:03,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 612. [2018-07-25 13:16:03,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-07-25 13:16:03,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1463 transitions. [2018-07-25 13:16:03,512 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1463 transitions. Word has length 13 [2018-07-25 13:16:03,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:03,513 INFO L472 AbstractCegarLoop]: Abstraction has 612 states and 1463 transitions. [2018-07-25 13:16:03,513 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:16:03,513 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1463 transitions. [2018-07-25 13:16:03,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:16:03,514 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:03,514 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:03,514 INFO L415 AbstractCegarLoop]: === Iteration 26 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:03,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1652407871, now seen corresponding path program 1 times [2018-07-25 13:16:03,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:03,532 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,532 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:03,532 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:03,532 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:03,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:03,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:03,533 INFO L87 Difference]: Start difference. First operand 612 states and 1463 transitions. Second operand 9 states. [2018-07-25 13:16:04,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:04,883 INFO L93 Difference]: Finished difference Result 854 states and 1987 transitions. [2018-07-25 13:16:04,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:16:04,884 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-25 13:16:04,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:04,886 INFO L225 Difference]: With dead ends: 854 [2018-07-25 13:16:04,887 INFO L226 Difference]: Without dead ends: 849 [2018-07-25 13:16:04,893 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:16:04,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-07-25 13:16:05,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 690. [2018-07-25 13:16:05,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-07-25 13:16:05,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1639 transitions. [2018-07-25 13:16:05,487 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1639 transitions. Word has length 13 [2018-07-25 13:16:05,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:05,487 INFO L472 AbstractCegarLoop]: Abstraction has 690 states and 1639 transitions. [2018-07-25 13:16:05,487 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:05,487 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1639 transitions. [2018-07-25 13:16:05,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:16:05,487 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:05,488 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:05,488 INFO L415 AbstractCegarLoop]: === Iteration 27 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:05,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1456173380, now seen corresponding path program 1 times [2018-07-25 13:16:05,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:05,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:05,494 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:05,494 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-25 13:16:05,494 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:16:05,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:16:05,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:16:05,494 INFO L87 Difference]: Start difference. First operand 690 states and 1639 transitions. Second operand 5 states. [2018-07-25 13:16:06,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:06,493 INFO L93 Difference]: Finished difference Result 1308 states and 3113 transitions. [2018-07-25 13:16:06,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:16:06,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-07-25 13:16:06,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:06,496 INFO L225 Difference]: With dead ends: 1308 [2018-07-25 13:16:06,496 INFO L226 Difference]: Without dead ends: 709 [2018-07-25 13:16:06,497 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:06,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-07-25 13:16:07,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 690. [2018-07-25 13:16:07,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-07-25 13:16:07,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-07-25 13:16:07,121 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-07-25 13:16:07,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:07,121 INFO L472 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-07-25 13:16:07,121 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:16:07,121 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-07-25 13:16:07,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:16:07,122 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:07,122 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:07,124 INFO L415 AbstractCegarLoop]: === Iteration 28 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:07,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1952744875, now seen corresponding path program 1 times [2018-07-25 13:16:07,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:07,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:07,135 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:07,135 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:07,135 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:07,135 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:07,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:07,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:07,136 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 9 states. [2018-07-25 13:16:08,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:08,528 INFO L93 Difference]: Finished difference Result 979 states and 2143 transitions. [2018-07-25 13:16:08,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 13:16:08,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-25 13:16:08,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:08,532 INFO L225 Difference]: With dead ends: 979 [2018-07-25 13:16:08,532 INFO L226 Difference]: Without dead ends: 971 [2018-07-25 13:16:08,533 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=202, Invalid=668, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:16:08,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2018-07-25 13:16:09,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 725. [2018-07-25 13:16:09,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2018-07-25 13:16:09,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1649 transitions. [2018-07-25 13:16:09,199 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1649 transitions. Word has length 16 [2018-07-25 13:16:09,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:09,199 INFO L472 AbstractCegarLoop]: Abstraction has 725 states and 1649 transitions. [2018-07-25 13:16:09,199 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:09,199 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1649 transitions. [2018-07-25 13:16:09,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:16:09,200 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:09,200 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:09,200 INFO L415 AbstractCegarLoop]: === Iteration 29 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:09,201 INFO L82 PathProgramCache]: Analyzing trace with hash -51223093, now seen corresponding path program 1 times [2018-07-25 13:16:09,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:09,212 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:09,212 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:09,213 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:09,213 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:09,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:09,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:09,214 INFO L87 Difference]: Start difference. First operand 725 states and 1649 transitions. Second operand 9 states. [2018-07-25 13:16:10,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:10,628 INFO L93 Difference]: Finished difference Result 1244 states and 2740 transitions. [2018-07-25 13:16:10,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 13:16:10,628 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-25 13:16:10,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:10,632 INFO L225 Difference]: With dead ends: 1244 [2018-07-25 13:16:10,632 INFO L226 Difference]: Without dead ends: 1236 [2018-07-25 13:16:10,633 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=248, Invalid=942, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:16:10,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2018-07-25 13:16:11,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 729. [2018-07-25 13:16:11,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2018-07-25 13:16:11,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1657 transitions. [2018-07-25 13:16:11,297 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1657 transitions. Word has length 16 [2018-07-25 13:16:11,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:11,297 INFO L472 AbstractCegarLoop]: Abstraction has 729 states and 1657 transitions. [2018-07-25 13:16:11,297 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:11,297 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1657 transitions. [2018-07-25 13:16:11,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:16:11,298 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:11,298 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:11,299 INFO L415 AbstractCegarLoop]: === Iteration 30 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:11,299 INFO L82 PathProgramCache]: Analyzing trace with hash -666637335, now seen corresponding path program 1 times [2018-07-25 13:16:11,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:11,307 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:11,307 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:11,307 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:11,307 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:11,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:11,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:11,308 INFO L87 Difference]: Start difference. First operand 729 states and 1657 transitions. Second operand 9 states. [2018-07-25 13:16:12,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:12,571 INFO L93 Difference]: Finished difference Result 1187 states and 2621 transitions. [2018-07-25 13:16:12,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 13:16:12,571 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-25 13:16:12,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:12,574 INFO L225 Difference]: With dead ends: 1187 [2018-07-25 13:16:12,574 INFO L226 Difference]: Without dead ends: 1179 [2018-07-25 13:16:12,575 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:16:12,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2018-07-25 13:16:13,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 753. [2018-07-25 13:16:13,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-07-25 13:16:13,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1711 transitions. [2018-07-25 13:16:13,364 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1711 transitions. Word has length 16 [2018-07-25 13:16:13,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:13,364 INFO L472 AbstractCegarLoop]: Abstraction has 753 states and 1711 transitions. [2018-07-25 13:16:13,364 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:13,365 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1711 transitions. [2018-07-25 13:16:13,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:16:13,365 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:13,366 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:13,366 INFO L415 AbstractCegarLoop]: === Iteration 31 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:13,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1147109874, now seen corresponding path program 1 times [2018-07-25 13:16:13,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:13,374 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:13,374 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:13,374 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:13,374 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:13,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:13,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:13,376 INFO L87 Difference]: Start difference. First operand 753 states and 1711 transitions. Second operand 9 states. [2018-07-25 13:16:14,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:14,691 INFO L93 Difference]: Finished difference Result 1221 states and 2662 transitions. [2018-07-25 13:16:14,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 13:16:14,691 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-25 13:16:14,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:14,695 INFO L225 Difference]: With dead ends: 1221 [2018-07-25 13:16:14,695 INFO L226 Difference]: Without dead ends: 1213 [2018-07-25 13:16:14,696 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=211, Invalid=781, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:16:14,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2018-07-25 13:16:15,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 741. [2018-07-25 13:16:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-07-25 13:16:15,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1684 transitions. [2018-07-25 13:16:15,490 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1684 transitions. Word has length 16 [2018-07-25 13:16:15,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:15,490 INFO L472 AbstractCegarLoop]: Abstraction has 741 states and 1684 transitions. [2018-07-25 13:16:15,490 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:15,490 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1684 transitions. [2018-07-25 13:16:15,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:16:15,491 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:15,491 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:15,491 INFO L415 AbstractCegarLoop]: === Iteration 32 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:15,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1762524116, now seen corresponding path program 1 times [2018-07-25 13:16:15,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:15,500 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:15,500 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:15,500 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:15,500 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:15,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:15,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:15,501 INFO L87 Difference]: Start difference. First operand 741 states and 1684 transitions. Second operand 9 states. [2018-07-25 13:16:17,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:17,115 INFO L93 Difference]: Finished difference Result 1356 states and 2971 transitions. [2018-07-25 13:16:17,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 13:16:17,116 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-25 13:16:17,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:17,118 INFO L225 Difference]: With dead ends: 1356 [2018-07-25 13:16:17,118 INFO L226 Difference]: Without dead ends: 1348 [2018-07-25 13:16:17,119 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=200, Invalid=730, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:16:17,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2018-07-25 13:16:17,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 737. [2018-07-25 13:16:17,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2018-07-25 13:16:17,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1676 transitions. [2018-07-25 13:16:17,811 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1676 transitions. Word has length 16 [2018-07-25 13:16:17,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:17,811 INFO L472 AbstractCegarLoop]: Abstraction has 737 states and 1676 transitions. [2018-07-25 13:16:17,812 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:17,812 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1676 transitions. [2018-07-25 13:16:17,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:16:17,813 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:17,813 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:17,813 INFO L415 AbstractCegarLoop]: === Iteration 33 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:17,813 INFO L82 PathProgramCache]: Analyzing trace with hash 352691054, now seen corresponding path program 1 times [2018-07-25 13:16:17,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:17,827 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:17,827 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:17,828 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:17,828 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:17,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:17,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:17,829 INFO L87 Difference]: Start difference. First operand 737 states and 1676 transitions. Second operand 9 states. [2018-07-25 13:16:19,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:19,306 INFO L93 Difference]: Finished difference Result 1200 states and 2616 transitions. [2018-07-25 13:16:19,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 13:16:19,306 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-25 13:16:19,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:19,309 INFO L225 Difference]: With dead ends: 1200 [2018-07-25 13:16:19,309 INFO L226 Difference]: Without dead ends: 1192 [2018-07-25 13:16:19,310 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=699, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:16:19,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2018-07-25 13:16:19,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 645. [2018-07-25 13:16:19,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2018-07-25 13:16:19,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1456 transitions. [2018-07-25 13:16:19,978 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1456 transitions. Word has length 16 [2018-07-25 13:16:19,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:19,978 INFO L472 AbstractCegarLoop]: Abstraction has 645 states and 1456 transitions. [2018-07-25 13:16:19,979 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:19,979 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1456 transitions. [2018-07-25 13:16:19,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:16:19,980 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:19,980 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:19,980 INFO L415 AbstractCegarLoop]: === Iteration 34 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:19,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1212722005, now seen corresponding path program 1 times [2018-07-25 13:16:19,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:19,989 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:19,989 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:19,990 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:19,990 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:19,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:19,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:19,990 INFO L87 Difference]: Start difference. First operand 645 states and 1456 transitions. Second operand 9 states. [2018-07-25 13:16:21,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:21,254 INFO L93 Difference]: Finished difference Result 978 states and 2118 transitions. [2018-07-25 13:16:21,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:16:21,254 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-25 13:16:21,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:21,256 INFO L225 Difference]: With dead ends: 978 [2018-07-25 13:16:21,256 INFO L226 Difference]: Without dead ends: 970 [2018-07-25 13:16:21,258 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:16:21,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2018-07-25 13:16:21,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 655. [2018-07-25 13:16:21,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2018-07-25 13:16:21,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1483 transitions. [2018-07-25 13:16:21,934 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1483 transitions. Word has length 16 [2018-07-25 13:16:21,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:21,934 INFO L472 AbstractCegarLoop]: Abstraction has 655 states and 1483 transitions. [2018-07-25 13:16:21,934 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:21,934 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1483 transitions. [2018-07-25 13:16:21,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:16:21,935 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:21,935 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:21,935 INFO L415 AbstractCegarLoop]: === Iteration 35 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:21,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1212619860, now seen corresponding path program 1 times [2018-07-25 13:16:21,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:21,942 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:21,942 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:21,942 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:21,943 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:21,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:21,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:21,943 INFO L87 Difference]: Start difference. First operand 655 states and 1483 transitions. Second operand 9 states. [2018-07-25 13:16:23,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:23,030 INFO L93 Difference]: Finished difference Result 920 states and 1979 transitions. [2018-07-25 13:16:23,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:16:23,031 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-25 13:16:23,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:23,032 INFO L225 Difference]: With dead ends: 920 [2018-07-25 13:16:23,032 INFO L226 Difference]: Without dead ends: 912 [2018-07-25 13:16:23,033 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:16:23,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2018-07-25 13:16:23,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 651. [2018-07-25 13:16:23,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-07-25 13:16:23,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1473 transitions. [2018-07-25 13:16:23,702 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1473 transitions. Word has length 16 [2018-07-25 13:16:23,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:23,702 INFO L472 AbstractCegarLoop]: Abstraction has 651 states and 1473 transitions. [2018-07-25 13:16:23,703 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:23,703 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1473 transitions. [2018-07-25 13:16:23,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:16:23,704 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:23,704 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:23,704 INFO L415 AbstractCegarLoop]: === Iteration 36 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:23,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1203705624, now seen corresponding path program 1 times [2018-07-25 13:16:23,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:23,715 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:23,715 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:23,715 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:16:23,715 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:16:23,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:16:23,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:16:23,716 INFO L87 Difference]: Start difference. First operand 651 states and 1473 transitions. Second operand 9 states. [2018-07-25 13:16:24,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:24,833 INFO L93 Difference]: Finished difference Result 859 states and 1857 transitions. [2018-07-25 13:16:24,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:16:24,833 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-25 13:16:24,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:24,834 INFO L225 Difference]: With dead ends: 859 [2018-07-25 13:16:24,834 INFO L226 Difference]: Without dead ends: 851 [2018-07-25 13:16:24,835 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:16:24,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-07-25 13:16:25,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 664. [2018-07-25 13:16:25,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-07-25 13:16:25,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1495 transitions. [2018-07-25 13:16:25,477 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1495 transitions. Word has length 16 [2018-07-25 13:16:25,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:25,477 INFO L472 AbstractCegarLoop]: Abstraction has 664 states and 1495 transitions. [2018-07-25 13:16:25,477 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:16:25,477 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1495 transitions. [2018-07-25 13:16:25,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:16:25,478 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:25,478 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,478 INFO L415 AbstractCegarLoop]: === Iteration 37 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:25,479 INFO L82 PathProgramCache]: Analyzing trace with hash -345007351, now seen corresponding path program 1 times [2018-07-25 13:16:25,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:25,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 13:16:25,485 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:25,485 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:25,486 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:25,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:25,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:25,486 INFO L87 Difference]: Start difference. First operand 664 states and 1495 transitions. Second operand 8 states. [2018-07-25 13:16:26,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:26,688 INFO L93 Difference]: Finished difference Result 1152 states and 2505 transitions. [2018-07-25 13:16:26,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 13:16:26,689 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 13:16:26,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:26,690 INFO L225 Difference]: With dead ends: 1152 [2018-07-25 13:16:26,690 INFO L226 Difference]: Without dead ends: 1144 [2018-07-25 13:16:26,691 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:16:26,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2018-07-25 13:16:27,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 847. [2018-07-25 13:16:27,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2018-07-25 13:16:27,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1923 transitions. [2018-07-25 13:16:27,486 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1923 transitions. Word has length 16 [2018-07-25 13:16:27,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:27,486 INFO L472 AbstractCegarLoop]: Abstraction has 847 states and 1923 transitions. [2018-07-25 13:16:27,486 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:27,486 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1923 transitions. [2018-07-25 13:16:27,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:16:27,487 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:27,487 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:27,488 INFO L415 AbstractCegarLoop]: === Iteration 38 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:27,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521947, now seen corresponding path program 1 times [2018-07-25 13:16:27,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:27,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 13:16:27,496 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:27,496 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:27,496 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:27,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:27,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:27,497 INFO L87 Difference]: Start difference. First operand 847 states and 1923 transitions. Second operand 8 states. [2018-07-25 13:16:28,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:28,952 INFO L93 Difference]: Finished difference Result 1279 states and 2776 transitions. [2018-07-25 13:16:28,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:16:28,953 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 13:16:28,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:28,954 INFO L225 Difference]: With dead ends: 1279 [2018-07-25 13:16:28,954 INFO L226 Difference]: Without dead ends: 1271 [2018-07-25 13:16:28,955 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:16:28,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2018-07-25 13:16:29,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 855. [2018-07-25 13:16:29,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2018-07-25 13:16:29,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1939 transitions. [2018-07-25 13:16:29,767 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1939 transitions. Word has length 16 [2018-07-25 13:16:29,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:29,768 INFO L472 AbstractCegarLoop]: Abstraction has 855 states and 1939 transitions. [2018-07-25 13:16:29,768 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:29,768 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1939 transitions. [2018-07-25 13:16:29,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:16:29,768 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:29,769 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:29,769 INFO L415 AbstractCegarLoop]: === Iteration 39 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:29,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521668, now seen corresponding path program 1 times [2018-07-25 13:16:29,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:29,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 13:16:29,776 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:29,776 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:29,776 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:29,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:29,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:29,777 INFO L87 Difference]: Start difference. First operand 855 states and 1939 transitions. Second operand 8 states. [2018-07-25 13:16:31,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:31,303 INFO L93 Difference]: Finished difference Result 1342 states and 2933 transitions. [2018-07-25 13:16:31,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:16:31,304 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 13:16:31,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:31,305 INFO L225 Difference]: With dead ends: 1342 [2018-07-25 13:16:31,305 INFO L226 Difference]: Without dead ends: 1334 [2018-07-25 13:16:31,306 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:16:31,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2018-07-25 13:16:32,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 916. [2018-07-25 13:16:32,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-07-25 13:16:32,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 2080 transitions. [2018-07-25 13:16:32,267 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 2080 transitions. Word has length 16 [2018-07-25 13:16:32,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:32,267 INFO L472 AbstractCegarLoop]: Abstraction has 916 states and 2080 transitions. [2018-07-25 13:16:32,267 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:32,267 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 2080 transitions. [2018-07-25 13:16:32,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:16:32,268 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:32,268 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:32,268 INFO L415 AbstractCegarLoop]: === Iteration 40 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:32,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1133346772, now seen corresponding path program 1 times [2018-07-25 13:16:32,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:32,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:32,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 13:16:32,276 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:32,276 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:32,277 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:32,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:32,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:32,277 INFO L87 Difference]: Start difference. First operand 916 states and 2080 transitions. Second operand 8 states. [2018-07-25 13:16:33,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:33,744 INFO L93 Difference]: Finished difference Result 1371 states and 2977 transitions. [2018-07-25 13:16:33,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:16:33,745 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 13:16:33,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:33,746 INFO L225 Difference]: With dead ends: 1371 [2018-07-25 13:16:33,746 INFO L226 Difference]: Without dead ends: 1363 [2018-07-25 13:16:33,747 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:16:33,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2018-07-25 13:16:34,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 937. [2018-07-25 13:16:34,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2018-07-25 13:16:34,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 2125 transitions. [2018-07-25 13:16:34,652 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 2125 transitions. Word has length 16 [2018-07-25 13:16:34,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:34,652 INFO L472 AbstractCegarLoop]: Abstraction has 937 states and 2125 transitions. [2018-07-25 13:16:34,652 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:34,653 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 2125 transitions. [2018-07-25 13:16:34,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:16:34,653 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:34,653 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:34,653 INFO L415 AbstractCegarLoop]: === Iteration 41 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:34,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1133347051, now seen corresponding path program 1 times [2018-07-25 13:16:34,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:34,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 13:16:34,660 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:34,660 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:34,660 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:34,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:34,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:34,660 INFO L87 Difference]: Start difference. First operand 937 states and 2125 transitions. Second operand 8 states. [2018-07-25 13:16:36,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:36,447 INFO L93 Difference]: Finished difference Result 1543 states and 3361 transitions. [2018-07-25 13:16:36,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:16:36,447 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 13:16:36,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:36,449 INFO L225 Difference]: With dead ends: 1543 [2018-07-25 13:16:36,449 INFO L226 Difference]: Without dead ends: 1535 [2018-07-25 13:16:36,450 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:16:36,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2018-07-25 13:16:37,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 920. [2018-07-25 13:16:37,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2018-07-25 13:16:37,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 2088 transitions. [2018-07-25 13:16:37,366 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 2088 transitions. Word has length 16 [2018-07-25 13:16:37,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:37,367 INFO L472 AbstractCegarLoop]: Abstraction has 920 states and 2088 transitions. [2018-07-25 13:16:37,367 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:37,367 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 2088 transitions. [2018-07-25 13:16:37,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:16:37,368 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:37,368 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:37,368 INFO L415 AbstractCegarLoop]: === Iteration 42 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:37,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1137226608, now seen corresponding path program 1 times [2018-07-25 13:16:37,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:37,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 13:16:37,380 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:37,380 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:37,380 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:37,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:37,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:37,381 INFO L87 Difference]: Start difference. First operand 920 states and 2088 transitions. Second operand 8 states. [2018-07-25 13:16:39,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:39,097 INFO L93 Difference]: Finished difference Result 1402 states and 3065 transitions. [2018-07-25 13:16:39,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:16:39,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 13:16:39,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:39,099 INFO L225 Difference]: With dead ends: 1402 [2018-07-25 13:16:39,099 INFO L226 Difference]: Without dead ends: 1394 [2018-07-25 13:16:39,100 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:16:39,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2018-07-25 13:16:40,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 933. [2018-07-25 13:16:40,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-07-25 13:16:40,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 2117 transitions. [2018-07-25 13:16:40,041 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 2117 transitions. Word has length 16 [2018-07-25 13:16:40,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:40,041 INFO L472 AbstractCegarLoop]: Abstraction has 933 states and 2117 transitions. [2018-07-25 13:16:40,041 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:40,041 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 2117 transitions. [2018-07-25 13:16:40,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:16:40,042 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:40,042 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:40,042 INFO L415 AbstractCegarLoop]: === Iteration 43 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:40,043 INFO L82 PathProgramCache]: Analyzing trace with hash 918935888, now seen corresponding path program 1 times [2018-07-25 13:16:40,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:40,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 13:16:40,052 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:40,052 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:40,053 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:40,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:40,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:40,053 INFO L87 Difference]: Start difference. First operand 933 states and 2117 transitions. Second operand 8 states. [2018-07-25 13:16:41,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:41,462 INFO L93 Difference]: Finished difference Result 1226 states and 2691 transitions. [2018-07-25 13:16:41,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:16:41,462 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 13:16:41,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:41,464 INFO L225 Difference]: With dead ends: 1226 [2018-07-25 13:16:41,464 INFO L226 Difference]: Without dead ends: 1218 [2018-07-25 13:16:41,464 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:16:41,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2018-07-25 13:16:42,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 916. [2018-07-25 13:16:42,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-07-25 13:16:42,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 2074 transitions. [2018-07-25 13:16:42,402 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 2074 transitions. Word has length 16 [2018-07-25 13:16:42,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:42,402 INFO L472 AbstractCegarLoop]: Abstraction has 916 states and 2074 transitions. [2018-07-25 13:16:42,402 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:42,402 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 2074 transitions. [2018-07-25 13:16:42,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:16:42,403 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:42,403 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:42,403 INFO L415 AbstractCegarLoop]: === Iteration 44 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:42,403 INFO L82 PathProgramCache]: Analyzing trace with hash 918936167, now seen corresponding path program 1 times [2018-07-25 13:16:42,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:42,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 13:16:42,408 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:42,408 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:42,408 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:42,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:42,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:42,409 INFO L87 Difference]: Start difference. First operand 916 states and 2074 transitions. Second operand 8 states. [2018-07-25 13:16:44,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:44,069 INFO L93 Difference]: Finished difference Result 1398 states and 3075 transitions. [2018-07-25 13:16:44,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:16:44,069 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 13:16:44,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:44,071 INFO L225 Difference]: With dead ends: 1398 [2018-07-25 13:16:44,071 INFO L226 Difference]: Without dead ends: 1390 [2018-07-25 13:16:44,072 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:16:44,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2018-07-25 13:16:45,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 899. [2018-07-25 13:16:45,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-07-25 13:16:45,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 2037 transitions. [2018-07-25 13:16:45,018 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 2037 transitions. Word has length 16 [2018-07-25 13:16:45,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:45,018 INFO L472 AbstractCegarLoop]: Abstraction has 899 states and 2037 transitions. [2018-07-25 13:16:45,019 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:45,019 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 2037 transitions. [2018-07-25 13:16:45,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:16:45,019 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:45,019 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:45,019 INFO L415 AbstractCegarLoop]: === Iteration 45 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:45,019 INFO L82 PathProgramCache]: Analyzing trace with hash 922815724, now seen corresponding path program 1 times [2018-07-25 13:16:45,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:45,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 13:16:45,024 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:45,024 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:45,025 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:45,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:45,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:45,025 INFO L87 Difference]: Start difference. First operand 899 states and 2037 transitions. Second operand 8 states. [2018-07-25 13:16:46,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:46,794 INFO L93 Difference]: Finished difference Result 1445 states and 3179 transitions. [2018-07-25 13:16:46,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 13:16:46,794 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 13:16:46,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:46,796 INFO L225 Difference]: With dead ends: 1445 [2018-07-25 13:16:46,796 INFO L226 Difference]: Without dead ends: 1437 [2018-07-25 13:16:46,796 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:16:46,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2018-07-25 13:16:47,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 895. [2018-07-25 13:16:47,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-07-25 13:16:47,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 2029 transitions. [2018-07-25 13:16:47,726 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 2029 transitions. Word has length 16 [2018-07-25 13:16:47,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:47,726 INFO L472 AbstractCegarLoop]: Abstraction has 895 states and 2029 transitions. [2018-07-25 13:16:47,726 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:47,726 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 2029 transitions. [2018-07-25 13:16:47,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:16:47,727 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:47,727 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:47,727 INFO L415 AbstractCegarLoop]: === Iteration 46 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:47,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1012397261, now seen corresponding path program 1 times [2018-07-25 13:16:47,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:47,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 13:16:47,735 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:47,735 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:16:47,735 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:47,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:47,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:47,735 INFO L87 Difference]: Start difference. First operand 895 states and 2029 transitions. Second operand 8 states. [2018-07-25 13:16:49,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:49,189 INFO L93 Difference]: Finished difference Result 1158 states and 2543 transitions. [2018-07-25 13:16:49,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:16:49,189 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 13:16:49,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:49,190 INFO L225 Difference]: With dead ends: 1158 [2018-07-25 13:16:49,191 INFO L226 Difference]: Without dead ends: 1150 [2018-07-25 13:16:49,191 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:16:49,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2018-07-25 13:16:50,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 856. [2018-07-25 13:16:50,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-07-25 13:16:50,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1928 transitions. [2018-07-25 13:16:50,080 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1928 transitions. Word has length 16 [2018-07-25 13:16:50,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:50,080 INFO L472 AbstractCegarLoop]: Abstraction has 856 states and 1928 transitions. [2018-07-25 13:16:50,081 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:50,081 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1928 transitions. [2018-07-25 13:16:50,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 13:16:50,081 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:50,081 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:50,081 INFO L415 AbstractCegarLoop]: === Iteration 47 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:50,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1223690942, now seen corresponding path program 1 times [2018-07-25 13:16:50,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:50,098 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:50,098 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:50,099 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:16:50,099 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:16:50,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:16:50,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:16:50,099 INFO L87 Difference]: Start difference. First operand 856 states and 1928 transitions. Second operand 11 states. [2018-07-25 13:16:52,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:52,493 INFO L93 Difference]: Finished difference Result 1562 states and 3408 transitions. [2018-07-25 13:16:52,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 13:16:52,493 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2018-07-25 13:16:52,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:52,495 INFO L225 Difference]: With dead ends: 1562 [2018-07-25 13:16:52,495 INFO L226 Difference]: Without dead ends: 1554 [2018-07-25 13:16:52,496 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=373, Invalid=959, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:16:52,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2018-07-25 13:16:54,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1302. [2018-07-25 13:16:54,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1302 states. [2018-07-25 13:16:54,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 2930 transitions. [2018-07-25 13:16:54,039 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 2930 transitions. Word has length 17 [2018-07-25 13:16:54,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:54,039 INFO L472 AbstractCegarLoop]: Abstraction has 1302 states and 2930 transitions. [2018-07-25 13:16:54,040 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:16:54,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 2930 transitions. [2018-07-25 13:16:54,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:16:54,040 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:54,040 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:54,041 INFO L415 AbstractCegarLoop]: === Iteration 48 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:54,041 INFO L82 PathProgramCache]: Analyzing trace with hash 532189918, now seen corresponding path program 1 times [2018-07-25 13:16:54,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:54,054 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:54,054 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:54,054 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:16:54,054 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:16:54,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:16:54,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:16:54,055 INFO L87 Difference]: Start difference. First operand 1302 states and 2930 transitions. Second operand 11 states. [2018-07-25 13:16:57,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:57,121 INFO L93 Difference]: Finished difference Result 2066 states and 4562 transitions. [2018-07-25 13:16:57,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 13:16:57,122 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 13:16:57,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:57,124 INFO L225 Difference]: With dead ends: 2066 [2018-07-25 13:16:57,124 INFO L226 Difference]: Without dead ends: 2058 [2018-07-25 13:16:57,125 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=168, Invalid=762, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:16:57,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2018-07-25 13:16:59,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 1536. [2018-07-25 13:16:59,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1536 states. [2018-07-25 13:16:59,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 3466 transitions. [2018-07-25 13:16:59,090 INFO L78 Accepts]: Start accepts. Automaton has 1536 states and 3466 transitions. Word has length 20 [2018-07-25 13:16:59,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:59,090 INFO L472 AbstractCegarLoop]: Abstraction has 1536 states and 3466 transitions. [2018-07-25 13:16:59,090 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:16:59,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 3466 transitions. [2018-07-25 13:16:59,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:16:59,091 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:59,092 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:59,092 INFO L415 AbstractCegarLoop]: === Iteration 49 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:59,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1283316220, now seen corresponding path program 1 times [2018-07-25 13:16:59,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:59,108 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:59,108 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:16:59,108 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:16:59,108 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:16:59,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:16:59,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:16:59,109 INFO L87 Difference]: Start difference. First operand 1536 states and 3466 transitions. Second operand 11 states. [2018-07-25 13:17:02,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:02,903 INFO L93 Difference]: Finished difference Result 2629 states and 5838 transitions. [2018-07-25 13:17:02,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-25 13:17:02,903 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 13:17:02,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:02,906 INFO L225 Difference]: With dead ends: 2629 [2018-07-25 13:17:02,906 INFO L226 Difference]: Without dead ends: 2621 [2018-07-25 13:17:02,907 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=279, Invalid=1527, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:17:02,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2621 states. [2018-07-25 13:17:05,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2621 to 2078. [2018-07-25 13:17:05,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2078 states. [2018-07-25 13:17:05,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 2078 states and 4754 transitions. [2018-07-25 13:17:05,471 INFO L78 Accepts]: Start accepts. Automaton has 2078 states and 4754 transitions. Word has length 20 [2018-07-25 13:17:05,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:05,471 INFO L472 AbstractCegarLoop]: Abstraction has 2078 states and 4754 transitions. [2018-07-25 13:17:05,471 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:17:05,471 INFO L276 IsEmpty]: Start isEmpty. Operand 2078 states and 4754 transitions. [2018-07-25 13:17:05,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:17:05,473 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:05,473 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:05,473 INFO L415 AbstractCegarLoop]: === Iteration 50 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:05,474 INFO L82 PathProgramCache]: Analyzing trace with hash -214966810, now seen corresponding path program 1 times [2018-07-25 13:17:05,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:05,489 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:17:05,489 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:05,489 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:17:05,489 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:17:05,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:17:05,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:17:05,490 INFO L87 Difference]: Start difference. First operand 2078 states and 4754 transitions. Second operand 11 states. [2018-07-25 13:17:10,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:10,870 INFO L93 Difference]: Finished difference Result 4196 states and 9626 transitions. [2018-07-25 13:17:10,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-25 13:17:10,870 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 13:17:10,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:10,875 INFO L225 Difference]: With dead ends: 4196 [2018-07-25 13:17:10,875 INFO L226 Difference]: Without dead ends: 4188 [2018-07-25 13:17:10,876 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=322, Invalid=1570, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 13:17:10,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4188 states. [2018-07-25 13:17:13,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4188 to 2494. [2018-07-25 13:17:13,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2494 states. [2018-07-25 13:17:13,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2494 states to 2494 states and 5846 transitions. [2018-07-25 13:17:13,704 INFO L78 Accepts]: Start accepts. Automaton has 2494 states and 5846 transitions. Word has length 20 [2018-07-25 13:17:13,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:13,704 INFO L472 AbstractCegarLoop]: Abstraction has 2494 states and 5846 transitions. [2018-07-25 13:17:13,704 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:17:13,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2494 states and 5846 transitions. [2018-07-25 13:17:13,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:17:13,706 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:13,706 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:13,706 INFO L415 AbstractCegarLoop]: === Iteration 51 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:13,706 INFO L82 PathProgramCache]: Analyzing trace with hash 523391216, now seen corresponding path program 1 times [2018-07-25 13:17:13,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:13,717 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:17:13,717 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:13,717 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:17:13,717 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:17:13,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:17:13,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:17:13,718 INFO L87 Difference]: Start difference. First operand 2494 states and 5846 transitions. Second operand 11 states. [2018-07-25 13:17:18,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:18,880 INFO L93 Difference]: Finished difference Result 4092 states and 9349 transitions. [2018-07-25 13:17:18,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-25 13:17:18,880 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 13:17:18,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:18,885 INFO L225 Difference]: With dead ends: 4092 [2018-07-25 13:17:18,885 INFO L226 Difference]: Without dead ends: 4084 [2018-07-25 13:17:18,887 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=450, Invalid=2306, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:17:18,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4084 states. [2018-07-25 13:17:21,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4084 to 2506. [2018-07-25 13:17:21,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2018-07-25 13:17:21,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 5876 transitions. [2018-07-25 13:17:21,827 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 5876 transitions. Word has length 20 [2018-07-25 13:17:21,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:21,827 INFO L472 AbstractCegarLoop]: Abstraction has 2506 states and 5876 transitions. [2018-07-25 13:17:21,827 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:17:21,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 5876 transitions. [2018-07-25 13:17:21,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:17:21,829 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:21,829 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:21,829 INFO L415 AbstractCegarLoop]: === Iteration 52 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:21,829 INFO L82 PathProgramCache]: Analyzing trace with hash 520590862, now seen corresponding path program 1 times [2018-07-25 13:17:21,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:21,839 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:17:21,840 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:21,840 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:17:21,840 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:17:21,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:17:21,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:17:21,841 INFO L87 Difference]: Start difference. First operand 2506 states and 5876 transitions. Second operand 11 states. [2018-07-25 13:17:27,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:27,243 INFO L93 Difference]: Finished difference Result 4084 states and 9319 transitions. [2018-07-25 13:17:27,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-25 13:17:27,243 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 13:17:27,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:27,248 INFO L225 Difference]: With dead ends: 4084 [2018-07-25 13:17:27,248 INFO L226 Difference]: Without dead ends: 4076 [2018-07-25 13:17:27,249 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=354, Invalid=1716, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 13:17:27,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4076 states. [2018-07-25 13:17:30,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4076 to 2630. [2018-07-25 13:17:30,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2018-07-25 13:17:30,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 6208 transitions. [2018-07-25 13:17:30,338 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 6208 transitions. Word has length 20 [2018-07-25 13:17:30,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:30,339 INFO L472 AbstractCegarLoop]: Abstraction has 2630 states and 6208 transitions. [2018-07-25 13:17:30,339 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:17:30,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 6208 transitions. [2018-07-25 13:17:30,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:17:30,340 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:30,340 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:30,341 INFO L415 AbstractCegarLoop]: === Iteration 53 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:30,341 INFO L82 PathProgramCache]: Analyzing trace with hash 520693007, now seen corresponding path program 1 times [2018-07-25 13:17:30,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:30,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:30,351 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:30,351 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:30,351 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:17:30,351 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:17:30,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:17:30,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:17:30,352 INFO L87 Difference]: Start difference. First operand 2630 states and 6208 transitions. Second operand 11 states. [2018-07-25 13:17:35,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:35,453 INFO L93 Difference]: Finished difference Result 3737 states and 8511 transitions. [2018-07-25 13:17:35,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 13:17:35,453 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 13:17:35,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:35,458 INFO L225 Difference]: With dead ends: 3737 [2018-07-25 13:17:35,458 INFO L226 Difference]: Without dead ends: 3729 [2018-07-25 13:17:35,459 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=224, Invalid=966, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:17:35,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3729 states. [2018-07-25 13:17:38,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3729 to 2684. [2018-07-25 13:17:38,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2684 states. [2018-07-25 13:17:38,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2684 states to 2684 states and 6332 transitions. [2018-07-25 13:17:38,572 INFO L78 Accepts]: Start accepts. Automaton has 2684 states and 6332 transitions. Word has length 20 [2018-07-25 13:17:38,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:38,572 INFO L472 AbstractCegarLoop]: Abstraction has 2684 states and 6332 transitions. [2018-07-25 13:17:38,572 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:17:38,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2684 states and 6332 transitions. [2018-07-25 13:17:38,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:17:38,574 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:38,574 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:38,574 INFO L415 AbstractCegarLoop]: === Iteration 54 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:38,575 INFO L82 PathProgramCache]: Analyzing trace with hash 759878049, now seen corresponding path program 1 times [2018-07-25 13:17:38,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:38,586 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:38,586 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:38,586 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:17:38,586 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:17:38,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:17:38,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:17:38,587 INFO L87 Difference]: Start difference. First operand 2684 states and 6332 transitions. Second operand 11 states. [2018-07-25 13:17:42,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:42,946 INFO L93 Difference]: Finished difference Result 3287 states and 7584 transitions. [2018-07-25 13:17:42,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:17:42,946 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 13:17:42,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:42,949 INFO L225 Difference]: With dead ends: 3287 [2018-07-25 13:17:42,949 INFO L226 Difference]: Without dead ends: 3279 [2018-07-25 13:17:42,950 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=159, Invalid=711, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:17:42,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2018-07-25 13:17:46,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 2762. [2018-07-25 13:17:46,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2762 states. [2018-07-25 13:17:46,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 6495 transitions. [2018-07-25 13:17:46,126 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 6495 transitions. Word has length 20 [2018-07-25 13:17:46,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:46,126 INFO L472 AbstractCegarLoop]: Abstraction has 2762 states and 6495 transitions. [2018-07-25 13:17:46,126 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:17:46,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 6495 transitions. [2018-07-25 13:17:46,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:17:46,128 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:46,128 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:46,128 INFO L415 AbstractCegarLoop]: === Iteration 55 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:46,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1511004351, now seen corresponding path program 1 times [2018-07-25 13:17:46,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:46,140 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:17:46,140 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:46,140 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:17:46,141 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:17:46,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:17:46,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:17:46,141 INFO L87 Difference]: Start difference. First operand 2762 states and 6495 transitions. Second operand 11 states. [2018-07-25 13:17:50,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:50,972 INFO L93 Difference]: Finished difference Result 3559 states and 8170 transitions. [2018-07-25 13:17:50,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 13:17:50,973 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 13:17:50,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:50,977 INFO L225 Difference]: With dead ends: 3559 [2018-07-25 13:17:50,977 INFO L226 Difference]: Without dead ends: 3551 [2018-07-25 13:17:50,978 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=172, Invalid=820, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:17:50,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3551 states. [2018-07-25 13:17:54,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3551 to 2944. [2018-07-25 13:17:54,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2944 states. [2018-07-25 13:17:54,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 6904 transitions. [2018-07-25 13:17:54,496 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 6904 transitions. Word has length 20 [2018-07-25 13:17:54,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:54,496 INFO L472 AbstractCegarLoop]: Abstraction has 2944 states and 6904 transitions. [2018-07-25 13:17:54,496 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:17:54,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 6904 transitions. [2018-07-25 13:17:54,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:17:54,498 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:54,498 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:54,498 INFO L415 AbstractCegarLoop]: === Iteration 56 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:54,498 INFO L82 PathProgramCache]: Analyzing trace with hash 12721321, now seen corresponding path program 1 times [2018-07-25 13:17:54,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:54,509 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:17:54,509 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:17:54,509 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:17:54,509 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:17:54,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:17:54,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:17:54,510 INFO L87 Difference]: Start difference. First operand 2944 states and 6904 transitions. Second operand 11 states. [2018-07-25 13:18:00,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:00,048 INFO L93 Difference]: Finished difference Result 3950 states and 9027 transitions. [2018-07-25 13:18:00,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-25 13:18:00,049 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 13:18:00,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:00,052 INFO L225 Difference]: With dead ends: 3950 [2018-07-25 13:18:00,052 INFO L226 Difference]: Without dead ends: 3942 [2018-07-25 13:18:00,053 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=258, Invalid=1382, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:18:00,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3942 states. [2018-07-25 13:18:03,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3942 to 3054. [2018-07-25 13:18:03,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3054 states. [2018-07-25 13:18:03,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3054 states to 3054 states and 7161 transitions. [2018-07-25 13:18:03,555 INFO L78 Accepts]: Start accepts. Automaton has 3054 states and 7161 transitions. Word has length 20 [2018-07-25 13:18:03,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:03,556 INFO L472 AbstractCegarLoop]: Abstraction has 3054 states and 7161 transitions. [2018-07-25 13:18:03,556 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:18:03,556 INFO L276 IsEmpty]: Start isEmpty. Operand 3054 states and 7161 transitions. [2018-07-25 13:18:03,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:18:03,557 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:03,557 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:03,557 INFO L415 AbstractCegarLoop]: === Iteration 57 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:03,557 INFO L82 PathProgramCache]: Analyzing trace with hash 751079347, now seen corresponding path program 1 times [2018-07-25 13:18:03,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:03,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:18:03,570 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:03,570 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:18:03,570 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:18:03,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:18:03,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:18:03,571 INFO L87 Difference]: Start difference. First operand 3054 states and 7161 transitions. Second operand 11 states. [2018-07-25 13:18:08,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:08,415 INFO L93 Difference]: Finished difference Result 3761 states and 8627 transitions. [2018-07-25 13:18:08,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 13:18:08,415 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 13:18:08,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:08,420 INFO L225 Difference]: With dead ends: 3761 [2018-07-25 13:18:08,420 INFO L226 Difference]: Without dead ends: 3753 [2018-07-25 13:18:08,421 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=262, Invalid=1298, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:18:08,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3753 states. [2018-07-25 13:18:12,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3753 to 3054. [2018-07-25 13:18:12,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3054 states. [2018-07-25 13:18:12,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3054 states to 3054 states and 7161 transitions. [2018-07-25 13:18:12,042 INFO L78 Accepts]: Start accepts. Automaton has 3054 states and 7161 transitions. Word has length 20 [2018-07-25 13:18:12,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:12,042 INFO L472 AbstractCegarLoop]: Abstraction has 3054 states and 7161 transitions. [2018-07-25 13:18:12,043 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:18:12,043 INFO L276 IsEmpty]: Start isEmpty. Operand 3054 states and 7161 transitions. [2018-07-25 13:18:12,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:18:12,044 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:12,044 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:12,044 INFO L415 AbstractCegarLoop]: === Iteration 58 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:12,044 INFO L82 PathProgramCache]: Analyzing trace with hash 748278993, now seen corresponding path program 1 times [2018-07-25 13:18:12,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:12,056 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:18:12,057 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:12,057 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:18:12,057 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:18:12,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:18:12,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:18:12,058 INFO L87 Difference]: Start difference. First operand 3054 states and 7161 transitions. Second operand 11 states. [2018-07-25 13:18:16,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:16,902 INFO L93 Difference]: Finished difference Result 3732 states and 8563 transitions. [2018-07-25 13:18:16,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 13:18:16,902 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 13:18:16,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:16,906 INFO L225 Difference]: With dead ends: 3732 [2018-07-25 13:18:16,906 INFO L226 Difference]: Without dead ends: 3724 [2018-07-25 13:18:16,906 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=216, Invalid=974, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:18:16,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2018-07-25 13:18:20,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3026. [2018-07-25 13:18:20,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3026 states. [2018-07-25 13:18:20,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3026 states to 3026 states and 7081 transitions. [2018-07-25 13:18:20,429 INFO L78 Accepts]: Start accepts. Automaton has 3026 states and 7081 transitions. Word has length 20 [2018-07-25 13:18:20,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:20,429 INFO L472 AbstractCegarLoop]: Abstraction has 3026 states and 7081 transitions. [2018-07-25 13:18:20,429 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:18:20,429 INFO L276 IsEmpty]: Start isEmpty. Operand 3026 states and 7081 transitions. [2018-07-25 13:18:20,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:18:20,430 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:20,430 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:18:20,431 INFO L415 AbstractCegarLoop]: === Iteration 59 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:20,431 INFO L82 PathProgramCache]: Analyzing trace with hash 748381138, now seen corresponding path program 1 times [2018-07-25 13:18:20,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:20,439 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:18:20,440 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:20,440 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:18:20,440 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:18:20,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:18:20,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:18:20,440 INFO L87 Difference]: Start difference. First operand 3026 states and 7081 transitions. Second operand 11 states. [2018-07-25 13:18:24,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:24,904 INFO L93 Difference]: Finished difference Result 3407 states and 7825 transitions. [2018-07-25 13:18:24,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 13:18:24,904 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 13:18:24,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:24,908 INFO L225 Difference]: With dead ends: 3407 [2018-07-25 13:18:24,908 INFO L226 Difference]: Without dead ends: 3399 [2018-07-25 13:18:24,909 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:18:24,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2018-07-25 13:18:28,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 3008. [2018-07-25 13:18:28,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2018-07-25 13:18:28,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 7021 transitions. [2018-07-25 13:18:28,494 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 7021 transitions. Word has length 20 [2018-07-25 13:18:28,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:28,495 INFO L472 AbstractCegarLoop]: Abstraction has 3008 states and 7021 transitions. [2018-07-25 13:18:28,495 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:18:28,495 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 7021 transitions. [2018-07-25 13:18:28,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:18:28,496 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:28,496 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:28,496 INFO L415 AbstractCegarLoop]: === Iteration 60 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:28,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1524516609, now seen corresponding path program 1 times [2018-07-25 13:18:28,497 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:28,509 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:18:28,510 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:28,510 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:18:28,510 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:18:28,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:18:28,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:18:28,511 INFO L87 Difference]: Start difference. First operand 3008 states and 7021 transitions. Second operand 11 states. [2018-07-25 13:18:33,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:33,794 INFO L93 Difference]: Finished difference Result 3906 states and 8949 transitions. [2018-07-25 13:18:33,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 13:18:33,794 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 13:18:33,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:33,799 INFO L225 Difference]: With dead ends: 3906 [2018-07-25 13:18:33,799 INFO L226 Difference]: Without dead ends: 3898 [2018-07-25 13:18:33,800 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=179, Invalid=877, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:18:33,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3898 states. [2018-07-25 13:18:37,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3898 to 3115. [2018-07-25 13:18:37,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2018-07-25 13:18:37,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 7274 transitions. [2018-07-25 13:18:37,620 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 7274 transitions. Word has length 20 [2018-07-25 13:18:37,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:37,621 INFO L472 AbstractCegarLoop]: Abstraction has 3115 states and 7274 transitions. [2018-07-25 13:18:37,621 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:18:37,621 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 7274 transitions. [2018-07-25 13:18:37,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:18:37,622 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:37,622 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:37,622 INFO L415 AbstractCegarLoop]: === Iteration 61 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:37,623 INFO L82 PathProgramCache]: Analyzing trace with hash 26233579, now seen corresponding path program 1 times [2018-07-25 13:18:37,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:37,631 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:18:37,631 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:37,631 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:18:37,631 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:18:37,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:18:37,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:18:37,632 INFO L87 Difference]: Start difference. First operand 3115 states and 7274 transitions. Second operand 11 states. [2018-07-25 13:18:43,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:43,404 INFO L93 Difference]: Finished difference Result 4110 states and 9407 transitions. [2018-07-25 13:18:43,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 13:18:43,404 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 13:18:43,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:43,409 INFO L225 Difference]: With dead ends: 4110 [2018-07-25 13:18:43,409 INFO L226 Difference]: Without dead ends: 4102 [2018-07-25 13:18:43,410 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=193, Invalid=929, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:18:43,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4102 states. [2018-07-25 13:18:47,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4102 to 3126. [2018-07-25 13:18:47,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2018-07-25 13:18:47,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 7289 transitions. [2018-07-25 13:18:47,236 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 7289 transitions. Word has length 20 [2018-07-25 13:18:47,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:47,237 INFO L472 AbstractCegarLoop]: Abstraction has 3126 states and 7289 transitions. [2018-07-25 13:18:47,237 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:18:47,237 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 7289 transitions. [2018-07-25 13:18:47,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:18:47,238 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:47,238 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:47,238 INFO L415 AbstractCegarLoop]: === Iteration 62 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:47,238 INFO L82 PathProgramCache]: Analyzing trace with hash 764591605, now seen corresponding path program 1 times [2018-07-25 13:18:47,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:47,249 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:18:47,250 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:47,250 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:18:47,250 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:18:47,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:18:47,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:18:47,250 INFO L87 Difference]: Start difference. First operand 3126 states and 7289 transitions. Second operand 11 states. [2018-07-25 13:18:52,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:52,773 INFO L93 Difference]: Finished difference Result 4192 states and 9618 transitions. [2018-07-25 13:18:52,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 13:18:52,773 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 13:18:52,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:52,777 INFO L225 Difference]: With dead ends: 4192 [2018-07-25 13:18:52,777 INFO L226 Difference]: Without dead ends: 4184 [2018-07-25 13:18:52,778 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:18:52,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4184 states. [2018-07-25 13:18:56,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4184 to 3137. [2018-07-25 13:18:56,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2018-07-25 13:18:56,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 7311 transitions. [2018-07-25 13:18:56,623 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 7311 transitions. Word has length 20 [2018-07-25 13:18:56,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:56,623 INFO L472 AbstractCegarLoop]: Abstraction has 3137 states and 7311 transitions. [2018-07-25 13:18:56,623 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:18:56,623 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 7311 transitions. [2018-07-25 13:18:56,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:18:56,624 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:56,624 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:56,625 INFO L415 AbstractCegarLoop]: === Iteration 63 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:56,625 INFO L82 PathProgramCache]: Analyzing trace with hash 761791251, now seen corresponding path program 1 times [2018-07-25 13:18:56,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:56,636 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:18:56,636 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:18:56,637 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:18:56,637 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:18:56,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:18:56,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:18:56,637 INFO L87 Difference]: Start difference. First operand 3137 states and 7311 transitions. Second operand 11 states. [2018-07-25 13:19:02,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:02,192 INFO L93 Difference]: Finished difference Result 4267 states and 9777 transitions. [2018-07-25 13:19:02,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 13:19:02,192 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 13:19:02,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:02,197 INFO L225 Difference]: With dead ends: 4267 [2018-07-25 13:19:02,197 INFO L226 Difference]: Without dead ends: 4259 [2018-07-25 13:19:02,199 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=149, Invalid=781, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:19:02,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4259 states. [2018-07-25 13:19:06,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4259 to 3231. [2018-07-25 13:19:06,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3231 states. [2018-07-25 13:19:06,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3231 states to 3231 states and 7541 transitions. [2018-07-25 13:19:06,135 INFO L78 Accepts]: Start accepts. Automaton has 3231 states and 7541 transitions. Word has length 20 [2018-07-25 13:19:06,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:06,135 INFO L472 AbstractCegarLoop]: Abstraction has 3231 states and 7541 transitions. [2018-07-25 13:19:06,135 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:19:06,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3231 states and 7541 transitions. [2018-07-25 13:19:06,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:19:06,137 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:06,138 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:19:06,138 INFO L415 AbstractCegarLoop]: === Iteration 64 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:06,138 INFO L82 PathProgramCache]: Analyzing trace with hash 761893396, now seen corresponding path program 1 times [2018-07-25 13:19:06,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:06,147 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:19:06,148 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:06,148 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:19:06,148 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:19:06,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:19:06,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:19:06,149 INFO L87 Difference]: Start difference. First operand 3231 states and 7541 transitions. Second operand 11 states. [2018-07-25 13:19:11,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:11,444 INFO L93 Difference]: Finished difference Result 3973 states and 9077 transitions. [2018-07-25 13:19:11,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:19:11,444 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 13:19:11,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:11,449 INFO L225 Difference]: With dead ends: 3973 [2018-07-25 13:19:11,449 INFO L226 Difference]: Without dead ends: 3965 [2018-07-25 13:19:11,450 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:19:11,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2018-07-25 13:19:15,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3229. [2018-07-25 13:19:15,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3229 states. [2018-07-25 13:19:15,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3229 states to 3229 states and 7508 transitions. [2018-07-25 13:19:15,443 INFO L78 Accepts]: Start accepts. Automaton has 3229 states and 7508 transitions. Word has length 20 [2018-07-25 13:19:15,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:15,443 INFO L472 AbstractCegarLoop]: Abstraction has 3229 states and 7508 transitions. [2018-07-25 13:19:15,443 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:19:15,443 INFO L276 IsEmpty]: Start isEmpty. Operand 3229 states and 7508 transitions. [2018-07-25 13:19:15,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:19:15,445 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:15,445 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:19:15,445 INFO L415 AbstractCegarLoop]: === Iteration 65 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:15,445 INFO L82 PathProgramCache]: Analyzing trace with hash -290904542, now seen corresponding path program 1 times [2018-07-25 13:19:15,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:15,454 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:19:15,454 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:15,454 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:19:15,454 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:19:15,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:19:15,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:19:15,455 INFO L87 Difference]: Start difference. First operand 3229 states and 7508 transitions. Second operand 11 states. [2018-07-25 13:19:21,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:21,387 INFO L93 Difference]: Finished difference Result 4093 states and 9363 transitions. [2018-07-25 13:19:21,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 13:19:21,387 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 13:19:21,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:21,391 INFO L225 Difference]: With dead ends: 4093 [2018-07-25 13:19:21,391 INFO L226 Difference]: Without dead ends: 4085 [2018-07-25 13:19:21,392 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=160, Invalid=770, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:19:21,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4085 states. [2018-07-25 13:19:25,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4085 to 3212. [2018-07-25 13:19:25,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3212 states. [2018-07-25 13:19:25,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 7460 transitions. [2018-07-25 13:19:25,323 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 7460 transitions. Word has length 20 [2018-07-25 13:19:25,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:25,323 INFO L472 AbstractCegarLoop]: Abstraction has 3212 states and 7460 transitions. [2018-07-25 13:19:25,323 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:19:25,323 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 7460 transitions. [2018-07-25 13:19:25,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:19:25,325 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:25,325 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:19:25,325 INFO L415 AbstractCegarLoop]: === Iteration 66 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:25,325 INFO L82 PathProgramCache]: Analyzing trace with hash 447453484, now seen corresponding path program 1 times [2018-07-25 13:19:25,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:25,334 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:19:25,334 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:19:25,335 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-07-25 13:19:25,335 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:19:25,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:19:25,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:19:25,335 INFO L87 Difference]: Start difference. First operand 3212 states and 7460 transitions. Second operand 11 states. [2018-07-25 13:19:31,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:31,921 INFO L93 Difference]: Finished difference Result 4634 states and 10636 transitions. [2018-07-25 13:19:31,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 13:19:31,921 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 13:19:31,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:31,925 INFO L225 Difference]: With dead ends: 4634 [2018-07-25 13:19:31,925 INFO L226 Difference]: Without dead ends: 4626 [2018-07-25 13:19:31,926 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=148, Invalid=722, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:19:31,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4626 states. [2018-07-25 13:19:35,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4626 to 3219. [2018-07-25 13:19:35,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3219 states. [2018-07-25 13:19:35,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 3219 states and 7474 transitions. [2018-07-25 13:19:35,903 INFO L78 Accepts]: Start accepts. Automaton has 3219 states and 7474 transitions. Word has length 20 [2018-07-25 13:19:35,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:35,903 INFO L472 AbstractCegarLoop]: Abstraction has 3219 states and 7474 transitions. [2018-07-25 13:19:35,903 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:19:35,903 INFO L276 IsEmpty]: Start isEmpty. Operand 3219 states and 7474 transitions. [2018-07-25 13:19:35,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:19:35,905 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:35,905 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:19:35,905 INFO L415 AbstractCegarLoop]: === Iteration 67 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:35,905 INFO L82 PathProgramCache]: Analyzing trace with hash 444653130, now seen corresponding path program 1 times [2018-07-25 13:19:35,905 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:35,916 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:19:35,916 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:35,916 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:19:35,916 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:19:35,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:19:35,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:19:35,917 INFO L87 Difference]: Start difference. First operand 3219 states and 7474 transitions. Second operand 11 states. [2018-07-25 13:19:42,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:42,434 INFO L93 Difference]: Finished difference Result 4729 states and 10838 transitions. [2018-07-25 13:19:42,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 13:19:42,434 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 13:19:42,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:42,439 INFO L225 Difference]: With dead ends: 4729 [2018-07-25 13:19:42,439 INFO L226 Difference]: Without dead ends: 4721 [2018-07-25 13:19:42,439 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:19:42,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4721 states. [2018-07-25 13:19:46,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4721 to 3305. [2018-07-25 13:19:46,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3305 states. [2018-07-25 13:19:46,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 3305 states and 7688 transitions. [2018-07-25 13:19:46,512 INFO L78 Accepts]: Start accepts. Automaton has 3305 states and 7688 transitions. Word has length 20 [2018-07-25 13:19:46,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:46,513 INFO L472 AbstractCegarLoop]: Abstraction has 3305 states and 7688 transitions. [2018-07-25 13:19:46,513 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:19:46,513 INFO L276 IsEmpty]: Start isEmpty. Operand 3305 states and 7688 transitions. [2018-07-25 13:19:46,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:19:46,515 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:46,515 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:19:46,515 INFO L415 AbstractCegarLoop]: === Iteration 68 === [productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:46,516 INFO L82 PathProgramCache]: Analyzing trace with hash 444755275, now seen corresponding path program 1 times [2018-07-25 13:19:46,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:46,525 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:19:46,526 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:46,526 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:19:46,526 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:19:46,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:19:46,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:19:46,526 INFO L87 Difference]: Start difference. First operand 3305 states and 7688 transitions. Second operand 11 states. Received shutdown request... [2018-07-25 13:19:46,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:19:46,678 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 13:19:46,684 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 13:19:46,684 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:19:46 BoogieIcfgContainer [2018-07-25 13:19:46,684 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:19:46,685 INFO L168 Benchmark]: Toolchain (without parser) took 254586.55 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.4 GB). Free memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-07-25 13:19:46,687 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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:19:46,687 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.12 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:19:46,687 INFO L168 Benchmark]: Boogie Preprocessor took 54.66 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:19:46,689 INFO L168 Benchmark]: RCFGBuilder took 363.12 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:19:46,689 INFO L168 Benchmark]: TraceAbstraction took 254111.13 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.4 GB). Free memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-07-25 13:19:46,695 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.21 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 50.12 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 54.66 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 363.12 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 254111.13 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.4 GB). Free memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 222]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 222). Cancelled while BasicCegarLoop was constructing difference of abstraction (3305states) and interpolant automaton (currently 6 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (51 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 229]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 229). Cancelled while BasicCegarLoop was constructing difference of abstraction (3305states) and interpolant automaton (currently 6 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (51 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 364]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 364). Cancelled while BasicCegarLoop was constructing difference of abstraction (3305states) and interpolant automaton (currently 6 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (51 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 154). Cancelled while BasicCegarLoop was constructing difference of abstraction (3305states) and interpolant automaton (currently 6 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (51 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 294]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 294). Cancelled while BasicCegarLoop was constructing difference of abstraction (3305states) and interpolant automaton (currently 6 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (51 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 284]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 284). Cancelled while BasicCegarLoop was constructing difference of abstraction (3305states) and interpolant automaton (currently 6 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (51 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 277]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 277). Cancelled while BasicCegarLoop was constructing difference of abstraction (3305states) and interpolant automaton (currently 6 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (51 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 247]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 247). Cancelled while BasicCegarLoop was constructing difference of abstraction (3305states) and interpolant automaton (currently 6 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (51 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 54). Cancelled while BasicCegarLoop was constructing difference of abstraction (3305states) and interpolant automaton (currently 6 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (51 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 332]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 332). Cancelled while BasicCegarLoop was constructing difference of abstraction (3305states) and interpolant automaton (currently 6 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (51 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 240]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 240). Cancelled while BasicCegarLoop was constructing difference of abstraction (3305states) and interpolant automaton (currently 6 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (51 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 205]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 205). Cancelled while BasicCegarLoop was constructing difference of abstraction (3305states) and interpolant automaton (currently 6 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (51 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 264]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 264). Cancelled while BasicCegarLoop was constructing difference of abstraction (3305states) and interpolant automaton (currently 6 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (51 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 250]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 250). Cancelled while BasicCegarLoop was constructing difference of abstraction (3305states) and interpolant automaton (currently 6 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (51 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 254.0s OverallTime, 68 OverallIterations, 2 TraceHistogramMax, 159.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 19527 SDtfs, 49571 SDslu, 67765 SDs, 0 SdLazy, 143271 SolverSat, 10008 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1911 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 1719 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11046 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3305occurred in iteration=67, 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: 92.7s AutomataMinimizationTime, 67 MinimizatonAttempts, 38859 StatesRemovedByMinimization, 67 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1052 NumberOfCodeBlocks, 1052 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 984 ConstructedInterpolants, 0 QuantifiedInterpolants, 64066 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 68 InterpolantComputations, 27 PerfectInterpolantSequences, 33/137 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_out.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-19-46-711.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_13-19-46-711.csv Completed graceful shutdown